The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A064283 Least number which may be expressed as the sum of a prime number and a nonzero square in exactly n different ways. 6
 3, 6, 27, 38, 83, 167, 248, 227, 488, 398, 887, 668, 902, 908, 1238, 2012, 1448, 1748, 1592, 2537, 2672, 3902, 4457, 4703, 3632, 3713, 5843, 6233, 7052, 8333, 5297, 8888, 9602, 9092, 6368, 9908, 13187, 8153, 12473, 8777, 15923, 16463, 14528, 14852, 20807 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A064272(a(n)) = n and A064272(m) <> n for m < a(n). - Reinhard Zumkeller, Mar 31 2013 LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..100 PROG (Haskell) import Data.List (elemIndex) import Data.Maybe (fromJust) a064283 = (+ 2) . fromJust . (`elemIndex` a064272_list) -- Reinhard Zumkeller, Mar 31 2013 CROSSREFS Cf. A000040, A000290, A064233, A064272. Sequence in context: A200654 A208665 A256762 * A266857 A014561 A034502 Adjacent sequences: A064280 A064281 A064282 * A064284 A064285 A064286 KEYWORD nonn AUTHOR Robert G. Wilson v, Sep 24 2001 EXTENSIONS More terms from Vladeta Jovovic, Sep 25 2001 More terms from Sean A. Irvine, Jun 25 2023 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.

Last modified December 4 14:29 EST 2023. Contains 367563 sequences. (Running on oeis4.)