login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A002038 Numbers dividing A002037(i) and larger than A002037(i-1), for some i>0.
(Formerly M0749 N0282)
1
1, 2, 3, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210, 221, 230, 231, 238, 247, 253, 255, 266, 273, 285, 286, 299, 322, 323, 330, 345, 357, 374, 385, 390, 391, 399, 418, 429, 437, 442, 455, 462, 483, 494, 506, 510, 546, 561, 570, 595, 598, 627, 646, 663, 665, 690 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

Sequence constructed in van Lint's solution to problem 5412 posed by P. Erdős (in Amer. Math. Monthly, 1966), cf. reference.

REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=0..56.

J. H. van Lint, Solution to problem 5412, Amer. Math. Monthly 74 no.7 (1967), pp. 874-875. (See also A002037.)

PROG

(PARI) P=L=1; for(a=1, 699, a>P & forprime(p=L+1, L*=3, P*=p); P%a || print1(a", ")) \\ M. F. Hasler, Jan 02 2013

CROSSREFS

Cf. A002037.

Sequence in context: A266536 A059096 A257678 * A032501 A240212 A333551

Adjacent sequences:  A002035 A002036 A002037 * A002039 A002040 A002041

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

EXTENSIONS

Entry revised by M. F. Hasler, Jan 02 2013

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 31 19:40 EDT 2020. Contains 334748 sequences. (Running on oeis4.)