Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079497
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079497 a(1)=1, for n>2 a(n) is the smallest integer > a(n-1) such that sqrt(5)*a(n) is closer and > to an integer than sqrt(5)*a(n-1) ( i.e. a(n) is the smallest integer > a(n-1) such that frac(sqrt(5)*a(n))<frac(sqrt(5)*a(n-1) )). +0
1
1, 5, 9, 13, 17, 89, 161, 233, 305, 1597, 2889, 4181, 5473, 28657, 51841, 75025, 98209, 514229, 930249, 1346269, 1762289, 9227465, 16692641, 24157817, 31622993, 165580141, 299537289, 433494437, 567451585, 2971215073, 5374978561 (list; graph; listen)
OFFSET

1,2

FORMULA

a(1)=1 a(2)=5 a(3)=9 a(4)=13 for n>4 if n==1 mod 4 a(n)=6a(n)-a(n-1) a(n)=2a(n)-a(n-1) otherwise

CROSSREFS

Cf. A005246.

Sequence in context: A032493 A125018 A074787 this_sequence A081835 A088907 A046586

Adjacent sequences: A079494 A079495 A079496 this_sequence A079498 A079499 A079500

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 20 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 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research