login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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). 1
40, 320, 2160, 15004, 103680, 709804, 4868640, 33385280, 228811000, 1568358004, 10749957120, 73681030804, 505018447960, 3461452808000, 23725145626560, 162614587921804, 1114577054219520, 7639424691459004, 52361396168994000 (list; graph; refs; listen; history; internal format)
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 * A160328 A190312 A008355

Adjacent sequences:  A087951 A087952 A087953 * A087955 A087956 A087957

KEYWORD

easy,nonn

AUTHOR

Thomas Baruchel (baruchel(AT)users.sourceforge.net), Sep 21 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 14:07 EST 2012. Contains 205623 sequences.