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

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; internal format)
OFFSET

1,1

COMMENTS

A123373[n] = Sum[ Sum[ Prime[i]^Prime[j], {i,1,n}], {j,1,n}].

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 A138170

Adjacent sequences:  A122001 A122002 A122003 * A122005 A122006 A122007

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Oct 14 2006

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 15 03:14 EST 2012. Contains 205694 sequences.