|
Search: id:A119249
|
|
| |
|
| 4, 7, 10, 17, 22, 31, 41, 47, 49, 71, 71, 98, 119, 161, 169, 191, 191, 239, 239, 239, 338, 338, 338
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
FORMULA
|
A081952(n) = F(a(n)), where F(k) is the k-th Fibonacci number.
|
|
EXAMPLE
|
A081952(4) = 1597 and 1597 is the 17th Fibonacci number, so a(4) = 17.
|
|
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[x], {y, 1, 50}]
|
|
CROSSREFS
|
Cf. A081952.
Sequence in context: A131500 A003461 A023375 this_sequence A071415 A103408 A088408
Adjacent sequences: A119246 A119247 A119248 this_sequence A119250 A119251 A119252
|
|
KEYWORD
|
hard,more,nonn
|
|
AUTHOR
|
Ryan Propper (rpropper(AT)stanford.edu), Jul 22 2006
|
|
|
Search completed in 0.002 seconds
|
