Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138613
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138613 a(n) = sigma_2(a(n-1)): sum of squares of divisors of a(n-1) with a(1)=2. +0
3
2, 5, 26, 850, 943950, 1318281510000, 2755017380686402917800000, 10751241448828145947377163154256928532205365443200, 18665349732071130524849313082094840330754079952842290235019994667394396474887720\ 1760000000000000000 (list; graph; listen)
OFFSET

1,1

COMMENT

Are all following terms divisible by 10?

LINKS

Robert Gerbicz, Table of n, a(n) for n = 1..12

FORMULA

a(n>=1) = sigma_2(a(n-1)) = A001157(a(n-1)), a(1)=2.

EXAMPLE

a(1)=2, divisors of 2: {1,2}, hence a(2)=1^2+2^2=5;

a(2)=5, divisors of 5: {1,5}, hence a(3)=1^2+5^2=26;

a(3)=26, divisors of 5: {1,2,13,26}, hence a(4)=1^2+2^2+13^2+26^2=850.

MATHEMATICA

NestList[DivisorSigma[2, # ]&, 2, 9]

CROSSREFS

Cf. A001157, A033766, A079488.

Sequence in context: A064006 A003095 A023362 this_sequence A090744 A041571 A042259

Adjacent sequences: A138610 A138611 A138612 this_sequence A138614 A138615 A138616

KEYWORD

nonn

AUTHOR

Zak Seidov (zakseidov(AT)yahoo.com), May 14 2008

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research