Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,2

COMMENT

Records form A087161: a(A087161(n))=n and satisfy recurrence: A087161(n+3) = 5*A087161(n+2) - 6*A087161(n+1) + 2*A087161(n).

EXAMPLE

Initialize all terms to 2. 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=3, go 3 terms forward,

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

set a(14)=a(5)+1=3, etc.

The indices 1,2,4,7,10,14,... form A087160.

CROSSREFS

Cf. A087160, A087161.

Sequence in context: A003589 A082204 A152727 this_sequence A062502 A141242 A130285

Adjacent sequences: A087156 A087157 A087158 this_sequence A087160 A087161 A087162

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


AT&T Labs Research