login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A233360 Primes of the form L(k) + q(m) with k > 0 and m > 0, where L(k) is the k-th Lucas number (A000204), and q(.) is the strict partition function (A000009). 4
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 79, 83, 101, 103, 107, 127, 131, 149, 151, 193, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 307, 337, 347, 349, 379, 397, 401, 419, 421, 449, 463, 487, 523, 541, 571, 643, 647, 661 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Conjecture: The sequence has infinitely many terms.
This follows from the conjecture in A233359.
LINKS
EXAMPLE
a(1) = 2 since L(1) + q(1) = 1 + 1 = 2.
a(2) = 3 since L(1) + q(3) = 1 + 2 = 3.
a(3) = 5 since L(2) + q(3) = 3 + 2 = 5.
MATHEMATICA
n=0
Do[Do[If[LucasL[j]>=Prime[m], Goto[aa],
Do[If[PartitionsQ[k]==Prime[m]-LucasL[j],
n=n+1; Print[n, " ", Prime[m]]; Goto[aa]]; If[PartitionsQ[k]>Prime[m]-LucasL[j], Goto[bb]]; Continue, {k, 1, 2*(Prime[m]-LucasL[j])}]];
Label[bb]; Continue, {j, 1, 2*Log[2, Prime[m]]}];
Label[aa]; Continue, {m, 1, 125}]
CROSSREFS
Sequence in context: A228296 A176165 A196230 * A234960 A118850 A322443
KEYWORD
nonn
AUTHOR
Zhi-Wei Sun, Dec 08 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 5 10:07 EDT 2024. Contains 374020 sequences. (Running on oeis4.)