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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074828 a(1) = 1; for n>1, a(n) = smallest composite multiple of n if n is a prime else the smallest prime divisor of n if n is composite. 1
1, 4, 6, 2, 10, 2, 14, 2, 3, 2, 22, 2, 26, 2, 3, 2, 34, 2, 38, 2, 3, 2, 46, 2, 5, 2, 3, 2, 58, 2, 62, 2, 3, 2, 5, 2, 74, 2, 3, 2, 82, 2, 86, 2, 3, 2, 94, 2, 7, 2, 3, 2, 106, 2, 5, 2, 3, 2, 118, 2, 122, 2, 3, 2, 5, 2, 134, 2, 3, 2, 142, 2, 146, 2, 3, 2, 7, 2, 158, 2, 3, 2, 166, 2, 5, 2, 3, 2, 178, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(n) = 2n if n is a prime, a(2n+2) = 2.

PROG

(PARI) print1("1, "); for(n=2, 100, if(isprime(n), print1(2*n, ", "), print1(factor(n)[1, 1], ", "))) (Rick L. Shepherd)

CROSSREFS

Sequence in context: A021220 A195410 A095196 * A159193 A118967 A059030

Adjacent sequences:  A074825 A074826 A074827 * A074829 A074830 A074831

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 13 2002

EXTENSIONS

More terms from Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jun 07 2004

Entry revised by N. J. A. Sloane (njas(AT)research.att.com), Aug 13 2006

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 14 16:05 EST 2012. Contains 205635 sequences.