Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A067317
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A067317 n is in the sequence if 1+C(n,j) is prime for only 2 values of j (0<=j<=n), where C(n,j) is the binomial coefficient n choose j. +0
2
1, 3, 7, 15, 23, 31, 59, 63, 67, 81, 84, 93, 95, 127, 157, 170, 214, 239, 253, 255, 313, 470, 511, 622, 694, 1010, 1023, 1098 (list; graph; listen)
OFFSET

1,2

FORMULA

n values for which A067316(n)=2

EXAMPLE

The 2 values of j are 0 and n, which give the prime 2. The sequence includes all numbers 2^k-1 since C(2^k-1,j) is odd for all j.

MATHEMATICA

test[n_] := Module[{}, For[i=1, 2i<=n, i++, If[PrimeQ[Binomial[n, i]+1], Return[False]]]; True]; For[n=1, True, n++, If[test[n], Print[n]]]

CROSSREFS

Cf. A067316.

Sequence in context: A165469 A160160 A069119 this_sequence A141354 A131753 A001213

Adjacent sequences: A067314 A067315 A067316 this_sequence A067318 A067319 A067320

KEYWORD

more,nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Jan 15 2002

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