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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066886 Sum of the elements in any transversal of a p(n) by p(n) array containing the numbers from 1 to p(n)^2 in standard order. 3
5, 15, 65, 175, 671, 1105, 2465, 3439, 6095, 12209, 14911, 25345, 34481, 39775, 51935, 74465, 102719, 113521, 150415, 178991, 194545, 246559, 285935, 352529, 456385, 515201, 546415, 612575, 647569, 721505, 1024255, 1124111, 1285745 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

a(n) is the sum of the primes in a p(n) by p(n) example of Haga's conjecture (see link below).

LINKS

Carlos Rivera, The prime puzzles & problems connection, conjecture 26

FORMULA

a(n) = p(n)*(p(n)^2+1)/2, where p(n) is the n-th prime.

MATHEMATICA

a[n_] := Prime[n](Prime[n]^2+1)/2

CROSSREFS

Cf. A066883, A066885, A006003.

Sequence in context: A149615 A149616 A189945 * A149617 A149618 A149619

Adjacent sequences:  A066883 A066884 A066885 * A066887 A066888 A066889

KEYWORD

easy,nonn

AUTHOR

Enoch Haga (Enokh(AT)comcast.net), Jan 22 2002

EXTENSIONS

Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Jun 08 2002

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 17 14:50 EST 2012. Contains 206050 sequences.