Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014668
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014668 a(1)=1, a(n)=sum(k=1, n-1, sum( d|k, a(d))). +0
3
1, 1, 3, 7, 16, 33, 71, 143, 295, 594, 1206, 2413, 4871, 9743, 19559, 39138, 78428, 156857, 314047, 628095, 1256809, 2513693, 5028594, 10057189, 20116979, 40233975, 80472823, 160945945, 321901713, 643803427, 1287627061, 2575254123 (list; graph; listen)
OFFSET

1,3

COMMENT

Contribution from Gary W. Adamson (qntmpkt(AT)yahoo.com), Jul 30 2009: (Start)

Equals eigensequence of triangle A010766 and starting (1, 3, 7, 16, 33,...) =

row sums of triangle A163313 (End)

FORMULA

a(n) is asymptotic ot c*2^n where c=0.59960731361450033896934...

PROGRAM

(PARI) // an=vector(100); a(n)=if(n<0, 0, an[n]); // an[1]=1; for(n=2, 100, an[n]=sum(k=1, n-1, sumdiv(k, d, a(d))))

CROSSREFS

A010766, A163313 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Jul 30 2009]

Sequence in context: A161810 A084631 A002936 this_sequence A054455 A026734 A026767

Adjacent sequences: A014665 A014666 A014667 this_sequence A014669 A014670 A014671

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 24 2003

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 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research