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!)
A334768 Self-convolution of A061397. 1
0, 0, 0, 0, 4, 12, 9, 20, 30, 28, 67, 0, 70, 44, 115, 52, 188, 0, 284, 68, 284, 76, 405, 0, 714, 92, 573, 0, 604, 0, 1182, 116, 668, 124, 1271, 0, 1960, 0, 795, 148, 1642, 0, 2680, 164, 1570, 172, 2183, 0, 3974, 188, 3024, 0, 2706, 0, 5354, 212, 2842, 0, 3799 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,5
COMMENTS
If any term of even index greater than 2 is equal to 0 then the Goldbach conjecture would be disproved.
LINKS
FORMULA
a(n) = Sum_{k=1..n-1} P(k)*P(n-k) where P(k) = A061397(k).
MAPLE
a:= n-> (f-> add(f(j)*f(n-j), j=0..n))(k-> `if`(isprime(k), k, 0)):
seq(a(n), n=0..60); # Alois P. Heinz, May 11 2020
MATHEMATICA
Table[Sum[If[PrimeQ[k], k, 0]*If[PrimeQ[n-k], n-k, 0], {k, 0, n}], {n, 0, 100}] (* Vaclav Kotesovec, May 10 2020 *)
PROG
(Python)
def a(n):
A061397 = [0]+[factorial(2*i-1)%(i**2) for i in range(1, n+1)]
sum = 0
for i in range(1, n):
sum += A061397[i] * A061397[n-i]
return sum
(PARI) P(n) = if (isprime(n), n);
a(n) = sum(k=1, n-1, P(k)*P(n-k)); \\ Michel Marcus, May 10 2020
CROSSREFS
Sequence in context: A229179 A273172 A307853 * A247327 A348419 A238581
KEYWORD
nonn,easy
AUTHOR
Lawrence Pepper, May 10 2020
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 April 23 12:27 EDT 2024. Contains 371912 sequences. (Running on oeis4.)