login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075227 Smallest odd prime not occurring in the numerator of the 2^n sums generated from the set 1, 1/2, 1/3,..., 1/n. 3
3, 5, 7, 17, 37, 43, 43, 151, 151, 409, 491, 491, 491, 1087, 2011, 3709, 3709, 7417, 7417, 7417 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

The largest prime generated is given in A075226. For information about how often the numerator of these sums is prime, see A075188 and A075189.

EXAMPLE

a(3) = 7 because 7 is the smallest prime not occurring in the numerator of the sums 1+1/2 = 3/2, 1/2+1/3 = 5/6 and 1+1/2+1/3 = 11/6.

MATHEMATICA

Needs["DiscreteMath`Combinatorica`"]; maxN=20; For[lst={}; prms={}; i=0; n=1, n<=maxN, n++, While[i<2^n-1, i++; s=NthSubset[i, Range[n]]; k=Numerator[Plus@@(1/s)]; If[PrimeQ[k], AppendTo[prms, k]]]; prms=Union[prms]; j=2; While[MemberQ[prms, Prime[j]], j++ ]; AppendTo[lst, Prime[j]]]; lst

CROSSREFS

Cf. A001008, A075135, A075188, A075189, A075226.

Sequence in context: A140797 A038893 A191064 * A064080 A184875 A112986

Adjacent sequences:  A075224 A075225 A075226 * A075228 A075229 A075230

KEYWORD

nice,nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Sep 08 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 18:47 EST 2012. Contains 205663 sequences.