|
Search: id:A060108
|
|
|
| A060108 |
|
Sequence of sums based on primes = 7 mod 8. |
|
+0
1
|
|
| 2, 22, 40, 92, 210, 260, 442, 672, 950, 1162, 1520, 1650, 2072, 2380, 2882, 3060, 4030, 5370, 5612, 6112, 7740, 8030, 8932, 9560, 9882, 10542, 14950, 15352, 16590, 17442, 21540, 22022, 23002, 23500, 28222, 29330, 31032, 32782, 34580, 35190
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
C. Popescu, Problem 10852, American Mathematical Monthly, Vol. 108 (2001), p. 171.
|
|
FORMULA
|
a(n)=sum(floor(k^2/p+1/2), k, 1, (p-1)/2) where p is n-th prime congruent to 7 mod 8 (i.e. A007522(n))
|
|
EXAMPLE
|
For n=2, p=A007522(2)=23, so a(2)=0+0+0+1+1+2+2+3+4+4+5=22.
|
|
CROSSREFS
|
A007522.
Sequence in context: A130751 A126913 A019593 this_sequence A080142 A053940 A123061
Adjacent sequences: A060105 A060106 A060107 this_sequence A060109 A060110 A060111
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Marc LeBrun (mlb(AT)well.com), Feb 27 2001
|
|
|
Search completed in 0.002 seconds
|
