login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A133488 a(1) = 1. a(n) = a(n-1) + a(m), where m is the largest term of the sequence {a(k)} which is less than n. 0
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; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
The largest term of the sequence which is less than 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, Dec 03 2007 *)
CROSSREFS
Sequence in context: A306315 A104352 A370584 * A351016 A068911 A243543
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Nov 30 2007
EXTENSIONS
More terms from Stefan Steinerberger, Dec 03 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)