|
Search: id:A062234
|
|
|
| A062234 |
|
a(n) =2*prime(n) - prime(n+1). |
|
+0
2
|
|
| 1, 1, 3, 3, 9, 9, 15, 15, 17, 27, 25, 33, 39, 39, 41, 47, 57, 55, 63, 69, 67, 75, 77, 81, 93, 99, 99, 105, 105, 99, 123, 125, 135, 129, 147, 145, 151, 159, 161, 167, 177, 171, 189, 189, 195, 187, 199, 219, 225, 225, 227, 237, 231, 245, 251, 257, 267, 265, 273, 279
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
It is known that a(n) > 0 for all n (Tchebycheff, 1850).
|
|
REFERENCES
|
J. V. Uspensky and M. A. Heaslet, Elementary Number Theory, McGraw-Hill, NY, 1939.
|
|
LINKS
|
Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
PROGRAM
|
(PARI) { for (n=1, 1000, write("b062234.txt", n, " ", 2*prime(n) - prime(n + 1)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Aug 03 2009]
|
|
CROSSREFS
|
Cf. A000040.
Sequence in context: A064235 A098355 A107443 this_sequence A161828 A086739 A147502
Adjacent sequences: A062231 A062232 A062233 this_sequence A062235 A062236 A062237
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 29 2001
|
|
|
Search completed in 0.002 seconds
|
