cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A067004 Number of numbers <= n with same number of divisors as n.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 4, 2, 2, 3, 5, 1, 6, 4, 5, 1, 7, 2, 8, 3, 6, 7, 9, 1, 3, 8, 9, 4, 10, 2, 11, 5, 10, 11, 12, 1, 12, 13, 14, 3, 13, 4, 14, 6, 7, 15, 15, 1, 4, 8, 16, 9, 16, 5, 17, 6, 18, 19, 17, 1, 18, 20, 10, 1, 21, 7, 19, 11, 22, 8, 20, 2, 21, 23, 12, 13, 24, 9, 22, 2, 2, 25, 23, 3, 26, 27
Offset: 1

Views

Author

Henry Bottomley, Dec 21 2001

Keywords

Examples

			a(10)=3 since 6,8,10 each have four divisors. a(11)=5 since 2,3,5,7,11 each have two divisors.
		

Crossrefs

Programs

  • Maple
    N:= 1000: # to get a(1) to a(N)
    R:= Vector(N):
    for n from 1 to N do
      v:= numtheory:-tau(n);
      R[v]:= R[v]+1;
      A[n]:= R[v];
    od:
    seq(A[n],n=1..N); # Robert Israel, May 04 2015
  • Mathematica
    b[_] = 0;
    a[n_] := a[n] = With[{t = DivisorSigma[0, n]}, b[t] = b[t]+1];
    Array[a, 105] (* Jean-François Alcover, Dec 20 2021 *)
  • PARI
    a(n)=my(d=numdiv(n)); sum(k=1,n,numdiv(k)==d) \\ Charles R Greathouse IV, Sep 02 2015

Formula

Ordinal transform of A000005. - Franklin T. Adams-Watters, Aug 28 2006
a(A000040(n)^(p-1)) = n if p is prime. - Robert Israel, May 04 2015

A079788 a(n) = count of numbers <= n for which the number of divisors is also <= tau(n).

Original entry on oeis.org

1, 2, 3, 4, 4, 6, 5, 8, 7, 10, 6, 12, 7, 13, 14, 15, 8, 18, 9, 20, 17, 18, 10, 24, 13, 21, 22, 27, 11, 30, 12, 30, 25, 26, 27, 36, 13, 29, 30, 39, 14, 41, 15, 39, 40, 33, 16, 48, 20, 44, 36, 46, 17, 52, 38, 54, 39, 40, 18, 60, 19, 43, 54, 55, 44, 63, 20, 57, 46, 67, 21, 72, 22, 49
Offset: 1

Views

Author

Amarnath Murthy, Feb 03 2003

Keywords

Examples

			a(7) = 5 as 1, 2, 3, 5 and 7 qualify for the count.
		

Crossrefs

Programs

  • Mathematica
    Do[s = 0; For[i = 1, i <= n, i++, If[DivisorSigma[0, i] <= DivisorSigma[0, n], s++ ]]; Print[s], {n, 1, 50}] (* Ryan Propper, Mar 30 2006 *)
  • PARI
    for(n=1,200,m=0;sn=sigma(n,0);for(i = 1,n,if(sigma(i,0)<=sn,m++));print1(m",")) \\ Herman Jamke (hermanjamke(AT)fastmail.fm), Apr 28 2007

Extensions

More terms from Ryan Propper, Mar 30 2006
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Apr 28 2007
Showing 1-2 of 2 results.