login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A159475 a(1) = 1; for n >= 1, a(n) = smallest number m > n such that gcd(n,m) > 1. 0
1, 4, 6, 6, 10, 8, 14, 10, 12, 12, 22, 14, 26, 16, 18, 18, 34, 20, 38, 22, 24, 24, 46, 26, 30, 28, 30, 30, 58, 32, 62, 34, 36, 36, 40, 38, 74, 40, 42, 42, 82, 44, 86, 46, 48, 48, 94, 50, 56, 52 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Essentially the same as A061228. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 16 2009]

FORMULA

If n = Product (p_i^e_i), where p_1 < p_2 < ... < p_k, a(n) = n + p_1. For p = primes (A000040), a(p) = 2*p.

CROSSREFS

Cf.: A000040.

Sequence in context: A183986 A160995 A155750 * A098350 A163173 A058640

Adjacent sequences:  A159472 A159473 A159474 * A159476 A159477 A159478

KEYWORD

nonn

AUTHOR

Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Apr 13 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:31 EST 2012. Contains 205978 sequences.