|
| |
|
|
A067316
|
|
Number of values of j, 0<=j<=n, such that 1+C(n,j) is prime, where C(n,j) is the binomial coefficient n choose j.
|
|
1
| |
|
|
1, 2, 3, 2, 5, 4, 4, 2, 5, 6, 6, 6, 6, 4, 5, 2, 6, 8, 8, 6, 6, 4, 4, 2, 11, 4, 4, 8, 8, 8, 4, 2, 6, 4, 8, 14, 8, 4, 5, 6, 12, 10, 4, 6, 9, 8, 8, 4, 6, 8, 6, 10, 6, 6, 12, 6, 8, 4, 12, 2, 6, 8, 4, 2, 8, 18, 8, 2, 6, 14, 10, 16, 10, 6, 4, 10, 13, 8, 12, 4, 8, 2, 8, 14, 2, 6, 4, 10, 10, 16, 10, 10, 9
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
EXAMPLE
| For n=8, the primes are 2,29,71,29,2, so a(n)=5. a(n)=6 for n=9,10,11,12. Also, a(n)=10 for n=149,...,154.
|
|
|
MATHEMATICA
| a[n_] := Count[Table[PrimeQ[Binomial[n, w]+1], {w, 0, n}], True]
|
|
|
CROSSREFS
| Sequence in context: A205706 A141658 A089587 * A127433 A055573 A182816
Adjacent sequences: A067313 A067314 A067315 * A067317 A067318 A067319
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Labos E. (labos(AT)ana.sote.hu), Jan 15 2002
|
| |
|
|
