Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A160994
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A160994 Least prime power having n divisors such that every sum of two or more divisors is composite. +0
1
3, 7, 7, 19, 19, 139, 151, 211, 211, 211, 421, 2311, 2311, 92401, 120121, 120121, 180181, 2312311 (list; graph; listen)
OFFSET

2,1

MATHEMATICA

(* first do *) Needs["Combinatorica`"] (* then *) f[n_] := Block[{d = Divisors@n, k, mx}, k = 1 + Length@d; mx = 2^Length[d]; While[k < mx && !PrimeQ[Plus @@ NthSubset[k, d]], k++ ]; If[k == mx, Length@d, 0]];

CROSSREFS

Sequence in context: A130003 A098581 A085420 this_sequence A113833 A157102 A121172

Adjacent sequences: A160991 A160992 A160993 this_sequence A160995 A160996 A160997

KEYWORD

nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 01 2009

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 4 23:11 EST 2009. Contains 170347 sequences.


AT&T Labs Research