Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157605
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157605 a(2)=1. a(n) = the largest integer coprime to a(n-1) and less than the nth Fibonacci number. +0
3
1, 1, 2, 3, 7, 12, 19, 33, 53, 88, 141, 232, 375, 608, 985, 1596, 2581, 4180, 6763, 10945, 17709, 28655, 46367, 75024, 121391, 196417, 317809, 514228, 832037, 1346268, 2178307, 3524577, 5702885, 9227464, 14930349, 24157816, 39088167, 63245984 (list; graph; listen)
OFFSET

2,3

MATHEMATICA

a[n_] := a[n] = Block[{k = Fibonacci@n - 1}, While[ GCD[k, a[n - 1]] > 1, k-- ]; k]; a[1] = a[2] = 1; Table[ a[n], {n, 2, 40}] [From Robert G. Wilson v (rgwv(AT)rgwv.com), May 04 2009]

CROSSREFS

A157420, A157604, A157606

Adjacent sequences: A157602 A157603 A157604 this_sequence A157606 A157607 A157608

Sequence in context: A006488 A121430 A023606 this_sequence A056179 A027675 A054176

KEYWORD

nonn

AUTHOR

Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Mar 02 2009

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), May 04 2009

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 8 07:45 EST 2009. Contains 166143 sequences.


AT&T Labs Research