Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082630
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082630 Start with the sequence S(0)={1,1} and for n>0 define S(n) to be I(S(n-1)) where I denotes the operation of inserting, for i=1,2,3..., the term a(i)+a(i+1) between any two terms for which 7a(i+1)<=11a(i). The listed terms are the initial terms of the limit of this process. +0
7
1, 2, 5, 8, 19, 30, 71, 112, 265, 418, 989, 1560, 3691, 5822, 13775, 21728, 51409, 81090, 191861, 302632, 716035, 1129438, 2672279, 4215120, 9973081, 15731042, 37220045, 58709048, 138907099, 219105150 (list; graph; listen)
OFFSET

1,2

COMMENT

The bisection {1,5,19,265,...} appears to be A001834 and to satisfy the recurrence a(n)=4a(n)-a(n-2) and the condition that 3a(n)^2+6 is a square. The other bisection {2,8,30,112,...} appears to be A052530, and one-half of this bisection, {1,4,15,56,...}, appears to be A001353 and to satisfy a(n)=4a(n-1)-a(n-2) and the condition that 3a(n)^2+1 is a square.

FORMULA

The sequence appears to satisfy a(n)=4a(n-2)-a(n-4).

Apparently a(n)a(n+3) = -2 + a(n+1)a(n+2). - R. Stephan, May 29 2004

EXAMPLE

Let S(0)={1,1}. Since 7*1<=11*1 we obtain S(1)={1,2,1}. Then since 7*2>11*1 and 7*1<=11*2, we obtain S(2)={1,2,3,1). Continuing, we get S(3)={1,2,5,3,4,1}, S(4)={1,2,5,8,3,7,4,5,1), S(5)={1,2,5,8,11,3,...}, S(6)={1,2,3,5,8,19,11,...}, etc.

CROSSREFS

Cf. A001353, A001834, A052530.

Sequence in context: A032063 A037233 A133147 this_sequence A025078 A055614 A076870

Adjacent sequences: A082627 A082628 A082629 this_sequence A082631 A082632 A082633

KEYWORD

nonn

AUTHOR

John W. Layman (layman(AT)math.vt.edu), May 23 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research