id:A159475 - OEIS Search Results

Search: id:A159475

Displaying 1-1 of 1 results found.

page 1

a(1) = 1; for n >= 1, a(n) = smallest number m > n such that gcd(n,m) > 1.

+0
1

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; listen)

	OFFSET	`1,2`
	COMMENT	`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: A016122 A160995 A155750 this_sequence A098350 A163173 A058640` `Adjacent sequences: A159472 A159473 A159474 this_sequence A159476 A159477 A159478`
	KEYWORD	`nonn`
	AUTHOR	`Jaroslav Krizek (jaroslav.krizek(AT)atlas.cz), Apr 13 2009`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research