Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081952
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081952 Smallest Fibonacci number which is one more than the product of n distinct numbers > 1. +0
3
3, 13, 55, 1597, 17711, 1346269, 165580141, 2971215073, 7778742049, 308061521170129, 308061521170129, 135301852344706746049, 3311648143516982017180081, 1983924214061919432247806074196061 (list; graph; listen)
OFFSET

1,1

COMMENT

Subset of A000045.

EXAMPLE

a(3)= 2*3*9 +1= 55. a(4) = 3*4*7*19 +1= 1597.

a(5)=2*5*7*11*23+1

a(6)=3*4*7*11*31*47+1

a(7)=3*4*5*11*29*41*211+1

a(8)=2*3*6*7*8*23*139*461+1

MATHEMATICA

f[n_, m_, 0] := n == 1; f[n_, m_, d_] := (b = False; l = Select[Divisors[n], #>=m&]; For[i = 1, i <= Length[l], i++, k = l[[i]]; If[f[n / k, k + 1, d - 1], b = True; Break[]]]; b); Do[x = 3; While[ !f[Fibonacci[x] - 1, 2, y], x++ ]; Print[Fibonacci[x]], {y, 1, 50}] - Ryan Propper (rpropper(AT)stanford.edu), Jul 22 2006

CROSSREFS

Cf. A081953.

Sequence in context: A151219 A006225 A100588 this_sequence A010903 A010920 A095934

Adjacent sequences: A081949 A081950 A081951 this_sequence A081953 A081954 A081955

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 02 2003

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 13 2006

More terms from Ryan Propper (rpropper(AT)stanford.edu), Jul 22 2006

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research