|
Search: id:A103153
|
|
|
| A103153 |
|
a(n) = Smallest prime p, such that 2n+1 = 2*p + A000040(k) for some k>1, 0 if no such prime exists. |
|
+0
7
|
|
| 0, 0, 0, 3, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 7, 5, 3, 3, 5, 5, 3, 7, 3, 3, 5, 3, 7, 5, 3, 7, 5, 3, 3, 5, 5, 3, 7, 3, 3, 5, 5, 3, 7, 3, 19, 5, 3, 7, 5, 11, 3, 11, 3, 3, 5, 3, 3, 5, 3, 7, 5, 11, 7, 11, 11, 3, 11, 3, 13, 5, 3, 3, 5, 5, 7, 7, 3, 3, 5, 5, 3, 7, 5, 3, 7, 3, 13, 5, 3, 7, 5, 3, 3, 5, 5, 7, 7, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
EXAMPLE
|
For n < 4 there are no such primes, thus a(1)-a(3)=0. For n=4, 2*4+1 = 9 = 2*3+3, thus a(4)=3. For n=7, 2*7+1 = 15 = 2*5+5, thus a(7)=7.
|
|
MATHEMATICA
|
Do[m = 3; While[ ! (PrimeQ[m] && ((n - 2*m) > 2) && PrimeQ[n - 2*m]), m = m + 2]; Print[m], {n, 9, 299, 2}]
|
|
PROGRAM
|
(Scheme:) (define (A103153 n) (let ((ind (A103507 n))) (if (zero? ind) 0 (A000040 ind))))
|
|
CROSSREFS
|
a(n)=0 if A103507(n)=0, otherwise A000040(A103507(n)). Cf. A103151, A103152, A002373.
Sequence in context: A084742 A049613 A002373 this_sequence A096918 A075018 A125958
Adjacent sequences: A103150 A103151 A103152 this_sequence A103154 A103155 A103156
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Lei Zhou (lzhou5(AT)emory.edu), Feb 09 2005
|
|
EXTENSIONS
|
Edited and Scheme-code added by Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Jun 19 2007
|
|
|
Search completed in 0.002 seconds
|
