Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117806
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117806 n appears {a(1)+a(2)+...+a(n-1)} times (with a(1)=1). +0
1
1, 2, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(1)=1 thus 2 appears one time and sequence begins with 1,2. Then 3 appears a(1)+a(2)=3 times and sequence continues 1,2,3,3,3.

CROSSREFS

Sequence in context: A081288 A130256 A103586 this_sequence A085423 A130241 A130247

Adjacent sequences: A117803 A117804 A117805 this_sequence A117807 A117808 A117809

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 29 2006

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 July 23 17:35 EDT 2008. Contains 142285 sequences.


AT&T Labs Research