Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087157
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087157 Satisfies a(1)=1, a(A087158(n+1)) = a(n)+1, with a(m)=1 for all m not found in A087158, where A087158(n+2)=A087158(n+1)+a(n)+1. +0
2
1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 5, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 6, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1, 3, 1, 1, 2, 1, 4, 1, 1, 1, 2, 1, 2, 1 (list; graph; listen)
OFFSET

1,2

COMMENT

Removing all the 1's results in the original sequence with every term incremented by 1.

FORMULA

Records are given by A055588(n): a(A055588(n))=n, where A055588(n)=Fibonacci(2n-2)+1 and Fibonacci(n)=A000045(n).

EXAMPLE

Initialize all terms to 1. Set a(1)=1, go one term forward,

set a(2)=a(1)+1=2, go 2 terms forward,

set a(4)=a(2)+1=3, go 3 terms forward,

set a(7)=a(3)+1=2, go 2 terms forward,

set a(9)=a(4)+1=4, go 4 terms forward,

set a(13)=a(5)+1=1, etc.

The indices 1,2,4,7,9,13,... form A087158.

CROSSREFS

Cf. A087158, A085246.

Sequence in context: A119804 A144869 A058564 this_sequence A138618 A140583 A123507

Adjacent sequences: A087154 A087155 A087156 this_sequence A087158 A087159 A087160

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Aug 22 2003

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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research