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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079833 Define f(n) = n + tau(n), then a(n) = smallest prime of the type f(f(f...f(n)))). 1
2, 7, 5, 7, 7, 71, 71, 71, 71, 71, 13, 71, 19, 71, 19, 71, 19, 71, 71, 71, 71, 71, 71, 71, 71, 71, 31, 71, 31, 71, 37, 71, 37, 71, 43, 59, 43, 71, 43, 811, 43, 71, 59, 71, 59, 71, 811, 811, 811, 71, 59, 811, 59, 811, 59, 71, 61, 811, 61, 163, 73, 811, 73, 71, 73, 811, 73 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

a(6) = 71 as f(6) = 10, f(10) = 14, f(14) = 18, f(18) = 24, f(24) = 32, f(32) = 38, f(38) = 42, f(42) = 50, f(50) = 56, f(56) = 64, f(64) = 64 +7 = 71.

PROG

(PARI) { a(n) = local(k, m); k=1; m=n; while(1, m=m+numdiv(m); if(isprime(m), return(m)); k++ ) } (Alekseyev)

CROSSREFS

Cf. A079834.

Sequence in context: A097157 A181320 A195450 * A198737 A010593 A117931

Adjacent sequences:  A079830 A079831 A079832 * A079834 A079835 A079836

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 12 2003

EXTENSIONS

More terms from Max Alekseyev (maxale(AT)gmail.com), Apr 19 2005

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 18:41 EST 2012. Contains 206074 sequences.