Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130148
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130148 a(1) = a(2) = 1. For n >= 2, n is repeated (a(n)+a(n-1)) times. +0
1
1, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Cf. A001462.

Adjacent sequences: A130145 A130146 A130147 this_sequence A130149 A130150 A130151

Sequence in context: A087845 A130146 A113764 this_sequence A087843 A087831 A058032

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Aug 02 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 October 16 00:31 EDT 2008. Contains 145098 sequences.


AT&T Labs Research