Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051901
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051901 Minimal factorial safe-primes: a p=a[n] here if (p-1)/n! = A051888[n]. +0
1
3, 5, 13, 73, 241, 2161, 15121, 282241, 1088641, 10886401, 199584001, 958003201, 18681062401, 1133317785601, 9153720576001, 648606486528001, 1778437140480001, 12804747411456001, 851515702861824001 (list; graph; listen)
OFFSET

1,1

FORMULA

a[n] = 1+n!*A051888[n]=1+A000142[n]*A051888[n]

EXAMPLE

a[8]= 282241 = 8!*A051888[8]= 40320*7+1

CROSSREFS

A005385, A051888, A000142.

Sequence in context: A144718 A066141 A159293 this_sequence A018928 A053630 A155012

Adjacent sequences: A051898 A051899 A051900 this_sequence A051902 A051903 A051904

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Dec 16 1999

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 15 00:47 EST 2009. Contains 170825 sequences.


AT&T Labs Research