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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145326 Least k such that f(n,k) is not a prime, where f(n,1)=4n-1 and f(n,k)=f(f(n,k-1)) for k>=2. 2
4, 2, 3, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 1, 2, 1, 2, 3, 1, 2, 3, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 3, 1, 2, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 3, 1, 1, 2, 1, 1, 2, 1, 1, 3, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

f(1,1)=3, f(1,2)=11, f(1,3)=43, f(1,4)=171, so a(1)=4.

CROSSREFS

Cf. A145325, A145327.

Sequence in context: A096870 A134977 A199081 * A178915 A016513 A063447

Adjacent sequences:  A145323 A145324 A145325 * A145327 A145328 A145329

KEYWORD

easy,nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu), Oct 07 2008

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 15 21:03 EST 2012. Contains 205852 sequences.