|
Search: id:A066496
|
|
|
| A066496 |
|
a(n) = least solution k of f(k) = f(k-1) + ... + f(k-n), where f(m) = p(n+1)-p(n) and p(n) denotes the n-th prime, if k exists; 0 otherwise. |
|
+0 1
|
| |
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
It seems that a(6) = 0; there is no solution < 10^7 to its corresponding equation.
|
|
EXAMPLE
|
3 is the smallest solution of f(k) = f(k-1); so a(1) = 3. 4 is the smallest solution of f(k) = f(k-1)+f(k-2); so a(2) = 4. 114 is the smallest solution of f(k) = f(k-1)+f(k-2)+f(k-3); so a(3) = 114.
|
|
MATHEMATICA
|
(for a(5)) Min[Select[Range[6, 10^4], f[ # ] == f[ # - 1] + f[ # - 2] + f[ # - 3] + f[ # - 4] + f[ # - 5] &]]
|
|
CROSSREFS
|
Adjacent sequences: A066493 A066494 A066495 this_sequence A066497 A066498 A066499
Sequence in context: A041253 A126578 A041351 this_sequence A041465 A004124 A077032
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jan 03 2002
|
|
|
Search completed in 0.002 seconds
|