Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A087954
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A087954 (2+phi)/a(n) is sum of successive remainders by computing euclidean algorithm for (1, A088166(n)/phi) with phi being the golden ratio (n>=2). +0
2
40, 320, 2160, 15004, 103680, 709804, 4868640, 33385280, 228811000, 1568358004, 10749957120, 73681030804, 505018447960, 3461452808000, 23725145626560, 162614587921804, 1114577054219520, 7639424691459004, 52361396168994000 (list; graph; listen)
OFFSET

2,1

FORMULA

For n=3k, a(n)=Lucas(4n)-2. For all other n, a(n)=Lucas(4n)-Lucas(2n).

CROSSREFS

Cf. A088166.

Sequence in context: A035099 A065255 A061993 this_sequence A008355 A007772 A055750

Adjacent sequences: A087951 A087952 A087953 this_sequence A087955 A087956 A087957

KEYWORD

easy,nonn

AUTHOR

Thomas Baruchel (baruchel(AT)users.sourceforge.net), Sep 21 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 September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research