<computation><program><author>_John Cannon_</author><language_tag>(MAGMA)</language_tag><file_ending>.m</file_ending><date>Dec 23 2006</date><source_code> D:=SmallGroupDatabase(); [ NumberOfSmallGroups(D, n) : n in [1..1000] ]; // _John Cannon_, Dec 23 2006
</source_code></program><program><author>_Muniru A Asiru_</author><language_tag>(GAP)</language_tag><file_ending>.gap</file_ending><date>Oct 15 2017</date><source_code> A000001 := Concatenation([0], List([1..500], n -> NumberSmallGroups(n))); # _Muniru A Asiru_, Oct 15 2017
<computation><program><author>unknown</author><language_tag>(PARI)</language_tag><file_ending>.gp</file_ending><date>unknown</date><source_code> my(a=[1,2,2]); for(n=3,80, for(i=1,a[n],a=concat(a,2-n%2))); a
</source_code></program><program><author>unknown</author><language_tag>(PARI)</language_tag><file_ending>.gp</file_ending><date>unknown</date><source_code> {a(n) = local(an=[1, 2, 2], m=3); if( n<1, 0, while( #an < n, an = concat( an, vector(an[m], i, 2-m%2)); m++); an[n])};
</source_code></program><program><author>_John Tromp_</author><language_tag>(Haskell)</language_tag><file_ending>.hs</file_ending><date>Apr 09 2011</date><source_code> a = 1:2: drop 2 (concat . zipWith replicate a . cycle $ [1,2]) -- _John Tromp_, Apr 09 2011
<computation><program><author>unknown</author><language_tag>(MAGMA)</language_tag><file_ending>.m</file_ending><date>unknown</date><source_code> [ 0 : n in [0..100]];
</source_code></program><program><author>unknown</author><language_tag>(PARI)</language_tag><file_ending>.gp</file_ending><date>unknown</date><source_code> {a(n)=polcoeff(sum(m=1, n+1, sumdiv(m, d, (-log(1-x^(m/d) +x*O(x^n) ))^d/d!)), n)} \\ _Paul D. Hanna_, Aug 21 2014
</source_code></program><program><author>unknown</author><language_tag>(MAGMA)</language_tag><file_ending>.m</file_ending><date>unknown</date><source_code> [ NumberOfDivisors(n) : n in [1..100] ]; // Sergei Haller (sergei(AT)sergei-haller.de), Dec 21 2006
</source_code></program><program><author>_Zerinvary Lajos_</author><language_tag>(Sage)</language_tag><file_ending>.sage</file_ending><date>Jun 04 2009</date><source_code> [sigma(n, 0) for n in range(1, 105)] # _Zerinvary Lajos_, Jun 04 2009
for n in range(1, 20): print(divisor_count(n), end=', ') # _Stefano Spezia_, Nov 05 2018
</source_code></program><program><author>_Muniru A Asiru_</author><language_tag>(GAP)</language_tag><file_ending>.gap</file_ending><date>Mar 05 2019</date><source_code> List([1..150],n->Tau(n)); # _Muniru A Asiru_, Mar 05 2019
<computation><program><author>unknown</author><language_tag>(PARI)</language_tag><file_ending>.gp</file_ending><date>unknown</date><source_code> (a(n)=sqrtint(prime(n))); vector(100,n,a(n)) \\ Edited by _M. F. Hasler_, Oct 19 2018
</source_code></program><program><author>_Charles R Greathouse IV_</author><language_tag>(PARI)</language_tag><file_ending>.gp</file_ending><date>Apr 26 2012</date><source_code> apply(sqrtint,primes(100)) \\ _Charles R Greathouse IV_, Apr 26 2012
</source_code></program><program><author>unknown</author><language_tag>(PARI)</language_tag><file_ending>.gp</file_ending><date>unknown</date><source_code> apply( A000006=n->sqrtint(prime(n)), [1..100]) \\ _M. F. Hasler_, Oct 19 2018
</source_code></program><program><author>unknown</author><language_tag>(MAGMA)</language_tag><file_ending>.m</file_ending><date>unknown</date><source_code> [1] cat [0:n in [1..100]]; // Sergei Haller, Dec 21 2006
p ks'@(k:ks) m = if m < k then 0 else p ks' (m - k) + p ks m
-- _Reinhard Zumkeller_, Dec 15 2013
</source_code></program><program><author>unknown</author><language_tag>(MAGMA)</language_tag><file_ending>.m</file_ending><date>unknown</date><source_code> [#RestrictedPartitions(n,{1,2,5,10}):n in [0..60]]; // _Marius A. Burtea_, May 07 2019
</source_code></program><program><author>unknown</author><language_tag>(MAGMA)</language_tag><file_ending>.m</file_ending><date>unknown</date><source_code> Coefficients(&*[1+x^m:m in [1..100]])[1..100] where x is PolynomialRing(Integers()).1; // Sergei Haller (sergei(AT)sergei-haller.de), Dec 21 2006
<computation><program><author>unknown</author><language_tag>(Axiom)</language_tag><file_ending>.unknown</file_ending><date>unknown</date><source_code> [eulerPhi(n) for n in 1..100]
</source_code></program><program><author>unknown</author><language_tag>(MAGMA)</language_tag><file_ending>.m</file_ending><date>unknown</date><source_code> [ EulerPhi(n) : n in [1..100] ]; // Sergei Haller (sergei(AT)sergei-haller.de), Dec 21 2006
def A000010_list(n): return [ euler_phi(i) for i in range(1,n+1)]
# Jaap Spies, Jan 07 2007
</source_code></program><program><author>unknown</author><language_tag>(PARI)</language_tag><file_ending>.gp</file_ending><date>unknown</date><source_code> { for (n=1, 100000, write("b000010.txt", n, " ", eulerphi(n))); } \\ _Harry J. Smith_, Apr 26 2009
</source_code></program><program><author>_Zerinvary Lajos_</author><language_tag>(Sage)</language_tag><file_ending>.sage</file_ending><date>Jun 06 2009</date><source_code> [euler_phi(n) for n in range(1, 70)] # _Zerinvary Lajos_, Jun 06 2009
</source_code></program><program><author>unknown</author><language_tag>(Haskell)</language_tag><file_ending>.hs</file_ending><date>unknown</date><source_code> a n = length (filter (==1) (map (gcd n) [1..n])) -- _Allan C. Wechsler_, Dec 29 2014
<computation><program><author>unknown</author><language_tag>(MAGMA)</language_tag><file_ending>.m</file_ending><date>unknown</date><source_code> [1 : n in [0..100]];
</source_code></program><program><author>_Charles R Greathouse IV_</author><language_tag>(PARI)</language_tag><file_ending>.gp</file_ending><date>Feb 01 2013</date><source_code> a(n)=if(n>1,while(!isprimepower(n),n++));n \\ _Charles R Greathouse IV_, Feb 01 2013
</source_code></program><program><author>_Zerinvary Lajos_</author><language_tag>(Sage)</language_tag><file_ending>.sage</file_ending><date>Jun 13 2009</date><source_code> [next_prime_power(n) for n in range(72)] # _Zerinvary Lajos_, Jun 13 2009
</source_code></program><program><author>unknown</author><language_tag>(MAGMA)</language_tag><file_ending>.m</file_ending><date>unknown</date><source_code> [NumberOfPrimitiveGroups(i) : i in [1..999]];