A371444
Numbers whose binary indices are composite numbers.
Original entry on oeis.org
8, 32, 40, 128, 136, 160, 168, 256, 264, 288, 296, 384, 392, 416, 424, 512, 520, 544, 552, 640, 648, 672, 680, 768, 776, 800, 808, 896, 904, 928, 936, 2048, 2056, 2080, 2088, 2176, 2184, 2208, 2216, 2304, 2312, 2336, 2344, 2432, 2440, 2464, 2472, 2560, 2568
Offset: 1
The terms together with their binary expansions and binary indices begin:
8: 1000 ~ {4}
32: 100000 ~ {6}
40: 101000 ~ {4,6}
128: 10000000 ~ {8}
136: 10001000 ~ {4,8}
160: 10100000 ~ {6,8}
168: 10101000 ~ {4,6,8}
256: 100000000 ~ {9}
264: 100001000 ~ {4,9}
288: 100100000 ~ {6,9}
296: 100101000 ~ {4,6,9}
384: 110000000 ~ {8,9}
392: 110001000 ~ {4,8,9}
416: 110100000 ~ {6,8,9}
424: 110101000 ~ {4,6,8,9}
512: 1000000000 ~ {10}
520: 1000001000 ~ {4,10}
544: 1000100000 ~ {6,10}
552: 1000101000 ~ {4,6,10}
640: 1010000000 ~ {8,10}
648: 1010001000 ~ {4,8,10}
672: 1010100000 ~ {6,8,10}
For powers of 2 instead of composite numbers we have
A253317.
For prime indices we have the even case of
A320628.
For prime instead of composite we have
A326782.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
-
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[100],EvenQ[#]&&And@@Not/@PrimeQ/@bpe[#]&]
A371448
Numbers such that (1) the product of prime indices is squarefree, and (2) the binary indices of prime indices cover an initial interval of positive integers.
Original entry on oeis.org
1, 2, 4, 5, 6, 8, 10, 12, 15, 16, 17, 20, 24, 26, 30, 32, 33, 34, 40, 47, 48, 51, 52, 55, 60, 64, 66, 68, 80, 85, 86, 94, 96, 102, 104, 110, 120, 123, 127, 128, 132, 136, 141, 143, 160, 165, 170, 172, 187, 188, 192, 204, 205, 208, 215, 220, 221, 226, 240, 246
Offset: 1
The terms together with their binary indices of prime indices begin:
1: {}
2: {{1}}
4: {{1},{1}}
5: {{1,2}}
6: {{1},{2}}
8: {{1},{1},{1}}
10: {{1},{1,2}}
12: {{1},{1},{2}}
15: {{2},{1,2}}
16: {{1},{1},{1},{1}}
17: {{1,2,3}}
20: {{1},{1},{1,2}}
24: {{1},{1},{1},{2}}
26: {{1},{2,3}}
30: {{1},{2},{1,2}}
32: {{1},{1},{1},{1},{1}}
33: {{2},{1,3}}
34: {{1},{1,2,3}}
40: {{1},{1},{1},{1,2}}
47: {{1,2,3,4}}
48: {{1},{1},{1},{1},{2}}
51: {{2},{1,2,3}}
The connected components of this multiset system are counted by
A371451.
A000009 counts partitions covering initial interval, compositions
A107429.
A011782 counts multisets covering an initial interval.
A070939 gives length of binary expansion.
A131689 counts patterns by number of distinct parts.
-
normQ[m_]:=Or[m=={},Union[m]==Range[Max[m]]];
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[1000], SquareFreeQ[Times@@prix[#]]&&normQ[Join@@bpe/@prix[#]]&]
A371455
Numbers k such that if we take the binary indices of each prime index of k we get an antichain of sets.
Original entry on oeis.org
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, 16, 17, 18, 19, 21, 23, 24, 25, 26, 27, 28, 29, 31, 32, 33, 35, 36, 37, 38, 41, 42, 43, 47, 48, 49, 52, 53, 54, 55, 56, 57, 58, 59, 61, 63, 64, 65, 67, 69, 71, 72, 73, 74, 76, 79, 81, 83, 84, 86, 89, 95, 96, 97, 98, 99
Offset: 1
The prime indices of 65 are {3,6} with binary indices {{1,2},{2,3}} so 65 is in the sequence.
The prime indices of 255 are {2,3,7} with binary indices {{2},{1,2},{1,2,3}} so 255 is not in the sequence.
Contains all powers of primes
A000961.
For prime indices of prime indices we have
A316476, carry-connected
A329559.
These antichains are counted by
A325109.
For binary indices of binary indices we have
A326704, carry-conn.
A326750.
A048143 counts connected antichains of sets.
A050320 counts set multipartitions of prime indices, see also
A318360.
A070939 gives length of binary expansion.
A089259 counts set multipartitions of integer partitions.
A116540 counts normal set multipartitions.
A371451 counts carry-connected components of binary indices.
-
stableQ[u_,Q_]:=!Apply[Or,Outer[#1=!=#2&&Q[#1,#2]&,u,u,1],{0,1}];
bix[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n], {p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],stableQ[bix/@prix[#],SubsetQ]&]
A371290
Numbers whose product of binary indices is a prime power > 1.
Original entry on oeis.org
1, 2, 3, 4, 5, 8, 9, 10, 11, 16, 17, 64, 65, 128, 129, 130, 131, 136, 137, 138, 139, 256, 257, 260, 261, 1024, 1025, 4096, 4097, 32768, 32769, 32770, 32771, 32776, 32777, 32778, 32779, 32896, 32897, 32898, 32899, 32904, 32905, 32906, 32907, 65536, 65537, 262144
Offset: 1
The terms together with their binary expansions and binary indices begin:
1: 1 ~ {1}
2: 10 ~ {2}
3: 11 ~ {1,2}
4: 100 ~ {3}
5: 101 ~ {1,3}
8: 1000 ~ {4}
9: 1001 ~ {1,4}
10: 1010 ~ {2,4}
11: 1011 ~ {1,2,4}
16: 10000 ~ {5}
17: 10001 ~ {1,5}
64: 1000000 ~ {7}
65: 1000001 ~ {1,7}
128: 10000000 ~ {8}
129: 10000001 ~ {1,8}
130: 10000010 ~ {2,8}
131: 10000011 ~ {1,2,8}
136: 10001000 ~ {4,8}
137: 10001001 ~ {1,4,8}
138: 10001010 ~ {2,4,8}
139: 10001011 ~ {1,2,4,8}
256: 100000000 ~ {9}
257: 100000001 ~ {1,9}
260: 100000100 ~ {3,9}
261: 100000101 ~ {1,3,9}
1024: 10000000000 ~ {11}
1025: 10000000001 ~ {1,11}
4096: 1000000000000 ~ {13}
4097: 1000000000001 ~ {1,13}
32768: 1000000000000000 ~ {16}
For squarefree numbers instead of prime powers we have
A371289.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
-
bpe[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[1000],#==1||PrimePowerQ[Times@@bpe[#]]&]
Comments