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.

A085865 a(1) = 2, a(n+1) = a(n)*{sigma(a(n))}, where sigma(n) is the sum of the divisors function.

Original entry on oeis.org

2, 6, 72, 14040, 707616000, 2299654269739008000, 25353370781704805143366427867873280000, 3361021040447648920437074194752848938805829494939344230020451929790873600000
Offset: 1

Views

Author

Amarnath Murthy, Jul 06 2003

Keywords

Comments

a(1) = 1, a(n+1) = a(n) + sigma(a(n)) gives A081973.

Examples

			a(3) = 72 and sigma(72)= 195, hence a(4) = 72*195 = 14040.
		

Crossrefs

Programs

  • PARI
    for(n=1,9,if(n==1,a=2,a*=sigma(a)); print(a); )

Extensions

More terms from Ray Chandler, Jul 16 2003

A165929 a(1) = 1; for n > 1, a(n) = sigma(sum of the previous terms) where sigma(k) = sum of the divisors of k.

Original entry on oeis.org

1, 1, 3, 6, 12, 24, 48, 120, 264, 480, 1104, 2064, 4128, 10752, 19320, 38328, 91992, 170016, 369600, 745560, 1854720, 3845760, 7765296, 14990520, 29910120, 59856720, 119710416, 298755600, 667297320, 1446528360, 4011171840
Offset: 1

Views

Author

Jaroslav Krizek, Sep 30 2009

Keywords

Comments

a(1) = 1; for n > 1, a(n) = sigma(Sum_{i=1..n-1} a(i)) = A000203(Sum_{i=1..n-1} a(i)).
a(n) = inverse of partial sums of A081973(n), i.e., a(1) = A081973(1); for n > 1, a(n) = A081973(n) - A081973(n-1), i.e., first differences of A081973.

Examples

			a(4) = sigma(a(1) + a(2) + a(3)) = sigma(1+1+3) = sigma(5) = 6.
		

Programs

  • Mathematica
    Module[{lst={1}},Do[AppendTo[lst,DivisorSigma[1,Total[lst]]],{40}]; lst] (* Harvey P. Dale, Sep 29 2012 *)
  • PARI
    print1(1);s=1;for(i=1,100,k=sigma(s);print1(","k);s+=k)

Extensions

Extension and program from Charles R Greathouse IV, Oct 12 2009
Showing 1-2 of 2 results.