Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A129280
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A129280 a(1)=1. a(n) = the sum of the earlier terms which are <= n. +0
10
1, 1, 2, 4, 8, 8, 8, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800, 800 (list; graph; listen)
OFFSET

1,3

LINKS

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

EXAMPLE

Terms a(1) through a(7) are each <= 10. So a(10) = sum{k=1 to 7} a(k) = 32.

CROSSREFS

Cf. A129279.

Sequence in context: A129279 A008496 A162794 this_sequence A103224 A078750 A054785

Adjacent sequences: A129277 A129278 A129279 this_sequence A129281 A129282 A129283

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Apr 07 2007

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research