|
|
A081953
|
|
Smallest Fibonacci number equal one plus the product of n (not necessarily distinct) integers > 1.
|
|
2
|
|
|
3, 5, 13, 55, 1597, 28657, 28657, 121393, 2971215073, 2971215073, 2971215073, 7778742049, 308061521170129, 308061521170129, 135301852344706746049, 135301852344706746049, 1454489111232772683678306641953
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(4)= 2*3*3*3 + 1 = 55.
a(5) = 2*3*3*7*19 + 1 = 1597.
|
|
MAPLE
|
for n from 1 to 14 do for fib from 2 to 5000 do f := combinat[fibonacci](fib)-1 ; allf := op(2, ifactors(f)) ; pow := 0 : for i from 1 to nops(allf) do pow := pow + op(2, op(i, allf)) ; od : if pow >= n then printf("%d, ", f+1) ; break ; fi ; od : od ; # R. J. Mathar, Apr 13 2006
|
|
PROG
|
(PARI) { m=3; for(n=1, 30, while(bigomega(fibonacci(m)-1)<n, m++); print1(fibonacci(m), ", "); ) } \\ Max Alekseyev, Apr 22 2010
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|