|
Search: id:A002071
|
|
|
| A002071 |
|
Number of pairs of consecutive integers x, x+1 such that all prime factors of both x and x+1 are at most the n-th prime.
(Formerly M3386 N1366)
|
|
+0
8
|
|
| 1, 4, 10, 23, 40, 68, 108, 167, 241, 345, 482, 653, 869, 1153, 1502
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
E. F. Ecklund and R. B. Eggleton, Prime factors of consecutive integers, Amer. Math. Monthly, 79 (1972), 1082-1089.
D. H. Lehmer, On a problem of Stormer, Ill. J. Math., 8 (1964), 57-69.
Stormer, Carl (1897). "Quelques theoremes sur l'equation de Pell x^2 - Dy^2 = +-1 et leurs applications". Skrifter Videnskabs-selskabet (Christiania), Mat.-Naturv. Kl. I (2).
|
|
LINKS
|
D. Eppstein, Smooth pairs.
D. Eppstein, Maple program
Wikipedia, Stormer's theorem
|
|
CROSSREFS
|
Cf. A002072.
Cf. A138180 (triangle of x values for each n).
Sequence in context: A023378 A038423 A109293 this_sequence A024980 A002766 A008268
Adjacent sequences: A002068 A002069 A002070 this_sequence A002072 A002073 A002074
|
|
KEYWORD
|
nonn,nice,more
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
Better description and more terms from David Eppstein (eppstein(AT)ics.uci.edu), Mar 23 2007
|
|
|
Search completed in 0.002 seconds
|
