Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A052109
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A052109 a(1)=1, a(n)=a(n-a(1))+a(n-a(2))+a(n-a(3))+....a(n-a(n-1)) for n>1, with convention that a(i)=0 for i<=0. +0
2
1, 1, 2, 5, 12, 30, 73, 178, 434, 1058, 2580, 6291, 15341, 37408, 91217, 222427, 542374, 1322546, 3224947, 7863835, 19175478, 46758223, 114017050, 278023561, 677943348, 1653123143, 4031039074, 9829440768, 23968486545, 58445679752, 142516194140, 347516970942 (list; graph; listen)
OFFSET

1,3

REFERENCES

Emmanuel Preissmann, A Self-Indexed Sequence, Journal of Integer Sequences, Vol. 8 (2005), Article 05.3.5.

EXAMPLE

a(5)=a(4)+a(4)+a(3)=5+5+2=12.

CROSSREFS

Sequence in context: A101411 A042789 A101911 this_sequence A157748 A046170 A062423

Adjacent sequences: A052106 A052107 A052108 this_sequence A052110 A052111 A052112

KEYWORD

easy,nonn,nice

AUTHOR

Robert Lozyniak (11(AT)onna.com), Jan 20 2000

EXTENSIONS

More terms from David W. Wilson (davidwwilson(AT)comcast.net), Feb 01 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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research