Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A165929
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A165929 a(1) = 1, for n > 1: a(n) = sigma(sum of the previous terms) where sigma(k) = sum of the divisors of k. +0
2
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 (list; graph; listen)
OFFSET

1,3

COMMENT

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 diferences of sequence A081973.

EXAMPLE

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

PROGRAM

(PARI) print1(1); s=1; for(i=1, 100, k=sigma(s); print1(", "k); s+=k)

CROSSREFS

Sequence in context: A007283 A049942 A099844 this_sequence A084717 A102254 A007239

Adjacent sequences: A165926 A165927 A165928 this_sequence A165930 A165931 A165932

KEYWORD

nonn

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Sep 30 2009

EXTENSIONS

Extension and program by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Oct 12 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research