cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 31-32 of 32 results.

A320323 Numbers whose product of prime indices (A003963) is a perfect power and where each prime index has the same number of prime factors, counted with multiplicity.

Original entry on oeis.org

7, 9, 19, 23, 25, 27, 49, 53, 81, 97, 103, 121, 125, 131, 151, 161, 169, 225, 227, 243, 289, 311, 343, 361, 419, 529, 541, 625, 661, 679, 691, 719, 729, 827, 841, 961, 1009, 1089, 1127, 1159, 1183, 1193, 1321, 1331, 1369, 1427, 1543, 1589, 1619, 1681, 1849
Offset: 1

Views

Author

Gus Wiseman, Oct 10 2018

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

Examples

			The terms together with their corresponding multiset multisystems (A302242):
    7: {{1,1}}
    9: {{1},{1}}
   19: {{1,1,1}}
   23: {{2,2}}
   25: {{2},{2}}
   27: {{1},{1},{1}}
   49: {{1,1},{1,1}}
   53: {{1,1,1,1}}
   81: {{1},{1},{1},{1}}
   97: {{3,3}}
  103: {{2,2,2}}
  121: {{3},{3}}
  125: {{2},{2},{2}}
  131: {{1,1,1,1,1}}
  151: {{1,1,2,2}}
  161: {{1,1},{2,2}}
  169: {{1,2},{1,2}}
  225: {{1},{1},{2},{2}}
		

Crossrefs

Programs

  • Mathematica
    primeMS[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],And[GCD@@FactorInteger[Times@@primeMS[#]][[All,2]]>1,SameQ@@PrimeOmega/@primeMS[#]]&]
  • PARI
    is(n) = my (f=factor(n), pi=apply(primepi, f[,1]~)); #Set(apply(bigomega, pi))==1 && ispower(prod(i=1, #pi, pi[i]^f[i,2])) \\ Rémy Sigrist, Oct 11 2018

A371732 Numbers n such that each binary index k (from row n of A048793) has the same sum of binary indices A029931(k).

Original entry on oeis.org

1, 2, 4, 8, 12, 16, 32, 64, 128, 144, 256, 288, 512, 576, 1024, 2048, 3072, 4096, 8192, 16384, 32768, 32800, 33024, 33056, 65536, 65600, 66048, 66112, 131072, 132096, 133120, 134144, 262144, 266240, 524288, 528384, 786432, 790528, 1048576, 1056768, 2097152
Offset: 1

Views

Author

Gus Wiseman, Apr 13 2024

Keywords

Examples

			The terms together with their binary expansions and binary indices begin:
        1:                1 ~ {1}
        2:               10 ~ {2}
        4:              100 ~ {3}
        8:             1000 ~ {4}
       12:             1100 ~ {3,4}
       16:            10000 ~ {5}
       32:           100000 ~ {6}
       64:          1000000 ~ {7}
      128:         10000000 ~ {8}
      144:         10010000 ~ {5,8}
      256:        100000000 ~ {9}
      288:        100100000 ~ {6,9}
      512:       1000000000 ~ {10}
      576:       1001000000 ~ {7,10}
     1024:      10000000000 ~ {11}
     2048:     100000000000 ~ {12}
     3072:     110000000000 ~ {11,12}
     4096:    1000000000000 ~ {13}
     8192:   10000000000000 ~ {14}
    16384:  100000000000000 ~ {15}
    32768: 1000000000000000 ~ {16}
    32800: 1000000000100000 ~ {6,16}
		

Crossrefs

For prime instead of binary indices we have A326534.
A048793 lists binary indices, A000120 length, A272020 reverse, A029931 sum.
A058891 counts set-systems, A003465 covering, A323818 connected.
A070939 gives length of binary expansion.
A096111 gives product of binary indices.
A321142 and A371794 count non-biquanimous strict partitions.
A321452 counts quanimous partitions, ranks A321454.
A326031 gives weight of the set-system with BII-number n.
A357976 ranks the biquanimous partitions counted by A002219 aerated.
A371731 ranks the non-biquanimous partitions counted by A371795, A006827.

Programs

  • Mathematica
    bix[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
    Select[Range[1000],SameQ@@Total/@bix/@bix[#]&]
Previous Showing 31-32 of 32 results.