|
Search: id:A133488
|
|
|
| A133488 |
|
a(1)=1. a(n) = a(n-1) + a(m), where m = the largest term of the sequence {a(k)} which is < n. |
|
+0
1
|
|
| 1, 2, 4, 6, 12, 18, 36, 54, 72, 90, 108, 126, 252, 378, 504, 630, 756, 882, 1764, 2646, 3528, 4410, 5292, 6174, 7056, 7938, 8820, 9702, 10584, 11466, 12348, 13230, 14112, 14994, 15876, 16758, 33516, 50274, 67032, 83790, 100548, 117306, 134064, 150822
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
The largest term of the sequence which is < 5 is a(3)=4. So a(5) = a(4) + a(4) = 6+6 = 12.
|
|
MATHEMATICA
|
a = {1}; Do[AppendTo[a, a[[ -1]] + a[[Select[a, # < n &][[ -1]]]]], {n, 2, 50}]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 03 2007
|
|
CROSSREFS
|
Sequence in context: A052823 A063516 A104352 this_sequence A068911 A094769 A068018
Adjacent sequences: A133485 A133486 A133487 this_sequence A133489 A133490 A133491
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet Nov 30 2007
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Dec 03 2007
|
|
|
Search completed in 0.002 seconds
|
