Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A104994
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A104994 Least k(n)>1 such that n*(k(n)^2)+n*k(n)+1 is a prime > (n-1)*((k(n-1)^2)+(n-1)*k(n-1)+1 or 0 if n=4 as no prime possible. +0
2
2, 2, 2, 0, 2, 2, 2, 3, 3, 6, 6, 7, 8, 8, 12, 14, 14, 19, 21, 21, 22, 27, 27, 28, 29, 29, 30, 30, 34, 37, 38, 39, 39, 41, 41, 43, 50, 52, 54, 54, 56 (list; graph; listen)
OFFSET

1,1

COMMENT

sequence of the primes given in A104995

EXAMPLE

1*2^2+1*2+1=7 prime so k(1)=2

2*2^2+2*2+1=13 prime > 7 so k(2)=2

3*2^2+3*2+1=19 prime > 13 so k(3)=2

5*2^2+5*2+1=31 prime > 19 so k(5)=2

CROSSREFS

Cf. A104995.

Sequence in context: A002100 A108352 A036476 this_sequence A118664 A118205 A130277

Adjacent sequences: A104991 A104992 A104993 this_sequence A104995 A104996 A104997

KEYWORD

nonn

AUTHOR

Pierre CAMI (pierrecami(AT)tele2.fr), Mar 31 2005

page 1

Search completed in 0.002 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research