|
| |
|
|
A066872
|
|
p^2 + 1 as p runs through the primes.
|
|
5
| |
|
|
5, 10, 26, 50, 122, 170, 290, 362, 530, 842, 962, 1370, 1682, 1850, 2210, 2810, 3482, 3722, 4490, 5042, 5330, 6242, 6890, 7922, 9410, 10202, 10610, 11450, 11882, 12770, 16130, 17162, 18770, 19322, 22202, 22802, 24650, 26570, 27890, 29930, 32042
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| From R. J. Mathar, Aug 28 2011 (Start):
There are at least three "natural" embeddings of this function into multiplicative functions b(n), c(n) and d(n):
(i) The first is b(n) = 1, 5, 10, 0, 26, 0, 50,.. (n>=1) with b(p) = p^2+1, b(p^e)=0 if e>=2, substituting zero for all composite n.
(ii) The second is c(n) = 1, 5, 10, 9, 26, 50, 50, 17, 28, 130,..(n>=1) with c(p^e)= p^(e+1)+1.
(iii) The third is d(n) = 1, 5, 10, 5, 26, 50, 50, 5, 10, 130,.. (n>=1) with d(p^e) = p^2+1 if e>=1. (End)
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
MATHEMATICA
| lst={}; Do[AppendTo[lst, DivisorSigma[2, Prime[n]]], {n, 5!}]; lst...and/or... lst={}; Do[AppendTo[lst, Prime[n]^2+1], {n, 5!}]; lst [From Vladimir Orlovsky, Mar 11 2009]
|
|
|
PROG
| (PARI) { for (n=1, 1000, write("b066872.txt", n, " ", prime(n)^2 + 1) ) } [From Harry J. Smith, Apr 02 2010]
|
|
|
CROSSREFS
| Sequence in context: A038252 A083010 A166388 * A063478 A025486 A128665
Adjacent sequences: A066869 A066870 A066871 * A066873 A066874 A066875
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Jan 21 2002
|
| |
|
|
