Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057217
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A057217 a(n) = smallest integer k such that 1+n*k! is a prime. +0
2
1, 1, 2, 1, 2, 1, 3, 2, 2, 1, 2, 1, 3, 2, 2, 1, 3, 1, 4, 2, 2, 1, 2, 4, 3, 2, 3, 1, 2, 1, 7, 3, 2, 6, 2, 1, 3, 3, 2, 1, 2, 1, 4, 2, 3, 1, 3, 2, 5, 2, 2, 1, 2, 2, 3, 2, 5, 1, 11, 1, 3, 3, 2, 5, 2, 1, 4, 2, 2, 1, 5, 1, 3, 2, 2, 3, 3, 1, 14, 5, 2, 1, 2, 4, 7, 2, 3, 1, 2, 2, 3, 8, 5, 7, 2, 1, 11, 2, 2, 1, 3, 1, 3 (list; graph; listen)
OFFSET

0,3

FORMULA

a(n)=Min{k|1+nk! is prime}

EXAMPLE

n=7, 1+7.k!={8,15,43,169,...}. The smallest k which gives prime is 3 and the prime so obtained is 43. n=267, the smallest k! is 31! for which 1+267*k! is prime and the prime so obtained is 65782709233423382541804503040000001

CROSSREFS

Sequence in context: A077480 A059829 A076558 this_sequence A147810 A055181 A073811

Adjacent sequences: A057214 A057215 A057216 this_sequence A057218 A057219 A057220

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Sep 27 2000

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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research