The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A122004 Primes p that divide A123373[p-1] = Sum[ Sum[ Prime[i]^Prime[j], {i,1,p-1}], {j,1,p-1}]. 0
 2, 3, 5, 23, 29 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A123373[n] = Sum[ Sum[ Prime[i]^Prime[j], {i,1,n}], {j,1,n}]. LINKS EXAMPLE A123373[n] begins {4, 48, 3598, 924780, 287358579128, ...}. a(1) = 2 because 2 divides A123373[1] = 4. a(2) = 3 because 3 divides A123373[2] = 48. a(3) = 5 because 5 divides A123373[4] = 924780. CROSSREFS Cf. A123373, A086787 - Sum(Sum(i^j, j=1..n), i=1..n). Sequence in context: A024767 A041195 A042141 * A023231 A034470 A237812 Adjacent sequences:  A122001 A122002 A122003 * A122005 A122006 A122007 KEYWORD hard,more,nonn AUTHOR Alexander Adamchuk, Oct 14 2006 STATUS approved

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

Last modified February 27 03:03 EST 2020. Contains 332299 sequences. (Running on oeis4.)