|
Search: id:A036277
|
|
|
| A036277 |
|
Position of first term > 2 in n-th row of Gilbreath array shown in A036262. |
|
+0
5
|
|
| 2, 4, 9, 15, 15, 26, 25, 24, 23, 26, 60, 99, 98, 99, 98, 175, 177, 177, 177, 177, 292, 291, 290, 741, 875, 874, 873, 874, 873, 872, 871, 870, 869, 868, 867, 2181, 2180, 2179, 2178, 2772, 2771, 2770, 2769, 2768, 2767, 2766, 2765, 2764, 2764, 2764, 2764, 3367
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
REFERENCES
|
A S Fraenkel and B J. Reuter, On certain sequences of integers and prime numbers, Proc. 2nd National Conf. Data Processing, Rehovoth, Jan 1966, pp. 450-437.
R. K. Guy, Unsolved Problems Number Theory, A10.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=0..274
A. M. Odlyzko, Iterated absolute values of differences of consecutive primes, Math. Comp., 61 (1993), pp. 373-380.
|
|
EXAMPLE
|
First row is 1 2 2 4 2 4 2 4 ... so a(1) = 4.
|
|
CROSSREFS
|
Sequence in context: A078671 A119637 A113862 this_sequence A042960 A045975 A058296
Adjacent sequences: A036274 A036275 A036276 this_sequence A036278 A036279 A036280
|
|
KEYWORD
|
easy,nice,nonn
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from David W. Wilson (davidwwilson(AT)comcast.net), Aug 30, 2000.
|
|
|
Search completed in 0.002 seconds
|
