login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
3, 4, 114, 852, 1648 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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

Sequence in context: A156182 A126578 A041351 * A041465 A004124 A175504

Adjacent sequences:  A066493 A066494 A066495 * A066497 A066498 A066499

KEYWORD

more,nonn

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jan 03 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 09:07 EST 2012. Contains 206000 sequences.