|
Search: id:A096369
|
|
|
| A096369 |
|
Triangle read by rows, 0<=k<n: T(n,k) = #{p prime: b(k)=1 and 2^(n-1) <= p=Sum(b(i)*2^i:0<=b(i)<2) < 2^n}. |
|
+0
1
|
|
| 0, 1, 2, 2, 1, 2, 2, 1, 1, 2, 5, 3, 3, 2, 5, 7, 3, 4, 5, 3, 7, 13, 7, 6, 6, 4, 7, 13, 23, 13, 12, 9, 10, 12, 11, 23, 43, 22, 23, 22, 23, 22, 21, 21, 43, 75, 37, 37, 36, 40, 39, 38, 38, 37, 75, 137, 71, 71, 73, 66, 56, 71, 70, 66, 67, 137, 255, 128, 125, 130, 127, 132, 128, 130, 129
(list; table; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
T(n,0) = A036378(n-1) for n>1; T(n,n-1) = T(n,0) for n>2;
T(n,1) = A095008(n-1) for n>2;
T(n,n-2) = A095766(n-1) for n>1;
conjecture: T(n,k) > 0 for n>1.
|
|
EXAMPLE
|
prime(12) = 37 -> 1 0 0 1 0 1 ..... n = 6
prime(13) = 41 -> 1 0 1 0 0 1 ..... all primes p:
prime(14) = 43 -> 1 0 1 0 1 1 ..... 2^(6-1) <= p < 2^6
prime(15) = 47 -> 1 0 1 1 1 1
prime(16) = 53 -> 1 1 0 1 0 1
prime(17) = 59 -> 1 1 1 0 1 1
prime(18) = 61 -> 1 1 1 1 0 1
col-sums of bits: 7 3 5 4 3 7 : T(6,5)=7, T(6,4)=3, T(6,3)=5,
...
|
|
CROSSREFS
|
Sequence in context: A087889 A014710 A055174 this_sequence A102297 A098398 A131714
Adjacent sequences: A096366 A096367 A096368 this_sequence A096370 A096371 A096372
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 19 2004
|
|
|
Search completed in 0.002 seconds
|
