Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122004
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122004 Primes p that divide A123373[p-1] = Sum[ Sum[ Prime[i]^Prime[j], {i,1,p-1}], {j,1,p-1}]. +0
1
2, 3, 5, 23, 29 (list; graph; listen)
OFFSET

1,1

COMMENT

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 this_sequence A023231 A034470 A138170

Adjacent sequences: A122001 A122002 A122003 this_sequence A122005 A122006 A122007

KEYWORD

hard,more,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research