Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068083
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068083 a(1) = 1, a(n) is the smallest Fibonacci number of the form k*a(n-1) + 1 with k>0. +0
1
1, 2, 3, 13, 144, 28657, 701408733, 679891637638612258, 394810887814999156320699623170776339, 215414832505658809004682396169711233230800418578767753330908886771798637 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(5) = 144 = 11*13 + 1, a(4) = 13.

MATHEMATICA

a[1]=1; a[n_] := a[n]=For[r=3, True, r++, If[Mod[Fibonacci[r]-1, a[n-1]]==0, Return[Fibonacci[r]]]]

CROSSREFS

Sequence in context: A013167 A068096 A125283 this_sequence A137459 A072162 A113785

Adjacent sequences: A068080 A068081 A068082 this_sequence A068084 A068085 A068086

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 18 2002

EXTENSIONS

Edited by Dean Hickerson (dean(AT)math.ucdavis.edu), Feb 20 2002

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