Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136314
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136314 a(0) = a(1) = 1. The nth run (after the initial two 1's) of (a(n)+a(n-1)) terms is (1,2,3,...,a(n)+a(n-1)). +0
1
1, 1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 2, 3 (list; graph; listen)
OFFSET

0,4

LINKS

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

EXAMPLE

Runs (after the initial first two 1's) each placed in parentheses:

(Notice that nth run in parentheses contains exactly a(n)+a(n-1) terms.)

1, 1, (1, 2), (1, 2), (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3), (1, 2, 3, 4, 5), (1, 2, 3, 4), (1, 2, 3), (1, 2, 3, 4, 5), (1, 2, 3, 4), (1, 2, 3), (1, 2, 3, 4, 5), (1, 2, 3, 4), (1, 2, 3), (1, 2, 3, 4, 5), (1, 2, 3, 4), (1, 2, 3), (1, 2, 3, 4, 5), (1, 2, 3, 4), (1, 2, 3), (1, 2, 3, 4, 5), (1, 2, 3, 4, 5, 6, 7), (1, 2, 3, 4, 5, 6, 7, 8, 9), (1, 2, 3, 4, 5, 6), (1, 2, 3), (1, 2, 3, 4, 5), (1, 2, 3, 4, 5, 6, 7)

CROSSREFS

Adjacent sequences: A136311 A136312 A136313 this_sequence A136315 A136316 A136317

Sequence in context: A136109 A105265 A061394 this_sequence A121997 A023128 A023118

KEYWORD

easy,nonn

AUTHOR

Leroy Quet, Mar 23 2008

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 January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research