Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055873
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055873 a(0) = 1; a(n) = sum_{k=1 to d(n)} [a(n-k)] where d(n) is number of positive divisors of n. +0
1
1, 1, 2, 3, 6, 9, 20, 29, 64, 113, 226, 339, 791, 1130, 2486, 4746, 9492, 14238, 32883, 47121, 110966, 205208, 396178, 601386, 1417472, 2415036, 4830072, 9263966, 18924110, 28188076, 66036296, 94224372, 221466892, 409915636, 791643196 (list; graph; listen)
OFFSET

0,3

LINKS

Leroy Quet, Home Page (listed in lieu of email address)

EXAMPLE

Since d(8) = 4, a(8) = a(7) +a(6) +a(5) +a(4) {4 terms}. So a(8) = 29 +20 +9 +6 =64.

CROSSREFS

Sequence in context: A011962 A060172 A003243 this_sequence A091053 A095064 A056353

Adjacent sequences: A055870 A055871 A055872 this_sequence A055874 A055875 A055876

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Jul 16 2000

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research