Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A145326
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
3
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; listen)
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: A075418 A096870 A134977 this_sequence A016513 A063447 A018845

Adjacent sequences: A145323 A145324 A145325 this_sequence A145327 A145328 A145329

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.453 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research