Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065871
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A065871 Usigma(n) +1 is a prime. +0
1
1, 3, 5, 6, 9, 10, 11, 17, 18, 20, 22, 24, 26, 27, 28, 29, 30, 38, 41, 42, 44, 45, 46, 50, 51, 52, 55, 56, 59, 62, 69, 71, 76, 77, 80, 81, 82, 85, 88, 90, 91, 98, 100, 101, 104, 105, 106, 107, 112, 114, 116, 118, 125, 126, 132, 136, 137, 140, 141, 145, 146, 148, 149 (list; graph; listen)
OFFSET

1,2

LINKS

Harry J. Smith, Table of n, a(n) for n=1,...,1000

MATHEMATICA

f[n_] := Block[ {a = FactorInteger[n], k = l = s = 1}, l = Length[a]; While[k <= l, s = s * (a[[k, 1]]^a[[k, 2]] + 1); k++ ]; Return[s]]; Select[ Range[200], PrimeQ[ f[ # ] + 1] & ]

PROGRAM

(PARI) usigma(n)= { local(f, s=1); f=factor(n); for(i=1, matsize(f)[1], s*=1 + f[i, 1]^f[i, 2]); return(s) } { n=0; for (m=1, 10^9, if (isprime(usigma(m) + 1), write("b065871.txt", n++, " ", m); if (n==1000, return)) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Nov 02 2009]

CROSSREFS

Cf. A034448.

Sequence in context: A056875 A087757 A088359 this_sequence A128291 A081121 A165740

Adjacent sequences: A065868 A065869 A065870 this_sequence A065872 A065873 A065874

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Dec 07 2001

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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research