Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A092764
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A092764
%S A092764 2,5,11,29,127,727,3628811,
%T A092764 80658175170943878571660636856403766975289505440883277824000000000053
%N A092764 Primes in the sequence f(n) = n! + n + 1 for n even or n! + n + 2 for 
               n odd.
%o A092764 (PARI) f(n) = n!+n+n%2+1 g(m) = for(x=0,m,y=f(x);if(isprime(y),print1(y",
               ")))
%Y A092764 Sequence in context: A117719 A014211 A160911 this_sequence A059075 A121134 
               A144959
%Y A092764 Adjacent sequences: A092761 A092762 A092763 this_sequence A092765 A092766 
               A092767
%K A092764 nonn
%O A092764 0,1
%A A092764 Cino Hilliard (hillcino368(AT)gmail.com), Apr 13 2004

    
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