A371455 Numbers k such that if we take the binary indices of each prime index of k we get an antichain of sets.
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
Keywords
Examples
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.
Links
- Jakub Buczak, Table of n, a(n) for n = 1..10000
Crossrefs
Contains all powers of primes A000961.
These antichains are counted by A325109.
A048143 counts connected antichains of sets.
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.
Programs
-
Mathematica
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]&]
Comments