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 11-14 of 14 results.

A361395 Positive integers k such that 2*omega(k) >= bigomega(k).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74
Offset: 1

Views

Author

Gus Wiseman, Mar 16 2023

Keywords

Comments

Differs from A068938 in having 1 and 4 and lacking 80.
Includes all squarefree numbers.

Examples

			The prime indices of 80 are {1,1,1,1,3}, with 5 parts and 2 distinct parts, and 2*2 < 5, so 80 is not in the sequence.
		

Crossrefs

Complement of A360558.
Positions of nonnegative terms in A361205.
These partitions are counted by A361394.
A001222 (bigomega) counts prime factors, distinct A001221 (omega).
A112798 lists prime indices, sum A056239.
A360005 gives median of prime indices (times 2), distinct A360457.
Comparing twice the number of distinct parts to the number of parts:
less: A360254, ranks A360558
equal: A239959, ranks A067801
greater: A237365, ranks A361393
less or equal: A237363, ranks A361204
greater or equal: A361394, ranks A361395

Programs

  • Mathematica
    Select[Range[100],2*PrimeNu[#]>=PrimeOmega[#]&]

Formula

A001222(a(n)) <= 2*A001221(a(n)).

A361393 Positive integers k such that 2*omega(k) > bigomega(k).

Original entry on oeis.org

2, 3, 5, 6, 7, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 26, 28, 29, 30, 31, 33, 34, 35, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 55, 57, 58, 59, 60, 61, 62, 63, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 84, 85
Offset: 1

Views

Author

Gus Wiseman, Mar 16 2023

Keywords

Comments

First differs from A317090 in having 120 and lacking 360.
There are numbers like 1, 120, 168, 180, 252,... which are not in A179983 but in here, and others like 360, 504, 540, 600,... which are in A179983 but not in here. - R. J. Mathar, Mar 21 2023

Examples

			The terms together with their prime indices begin:
    2: {1}
    3: {2}
    5: {3}
    6: {1,2}
    7: {4}
   10: {1,3}
   11: {5}
   12: {1,1,2}
   13: {6}
   14: {1,4}
   15: {2,3}
   17: {7}
   18: {1,2,2}
   19: {8}
   20: {1,1,3}
The prime indices of 120 are {1,1,1,2,3}, with 3 distinct parts and 5 parts, and 2*3 > 5, so 120 is in the sequence.
The prime indices of 360 are {1,1,1,2,2,3}, with 3 distinct parts and 6 parts, and 2*3 is not greater than 6, so 360 is not in the sequence.
		

Crossrefs

These partitions are counted by A237365.
The complement is A361204.
A001221 (omega) counts distinct prime factors.
A001222 (bigomega) counts prime factors.
A112798 lists prime indices, sum A056239.
A326567/A326568 gives mean of prime indices.
A360005 gives median of prime indices (times 2), distinct A360457.
Comparing twice the number of distinct parts to the number of parts:
less: A360254, ranks A360558
equal: A239959, ranks A067801
greater: A237365, ranks A361393
less or equal: A237363, ranks A361204
greater or equal: A361394, ranks A361395

Programs

  • Maple
    isA361393 := proc(n)
        if 2*A001221(n) > numtheory[bigomega](n) then
            true;
        else
            false ;
        end if:
    end proc:
    for n from 1 to 100 do
        if isA361393(n) then
            printf("%d,",n) ;
        end if;
    end do: # R. J. Mathar, Mar 21 2023
  • Mathematica
    Select[Range[1000],2*PrimeNu[#]>PrimeOmega[#]&]

Formula

{k: 2*A001221(k) > A001222(k)}. - R. J. Mathar, Mar 21 2023

A360681 Numbers for which the prime signature has the same median as the first differences of 0-prepended prime indices.

Original entry on oeis.org

1, 2, 6, 30, 42, 49, 60, 66, 70, 78, 84, 90, 102, 105, 114, 120, 126, 132, 138, 140, 150, 154, 156, 168, 174, 186, 198, 204, 210, 222, 228, 234, 246, 258, 264, 270, 276, 280, 282, 286, 294, 306, 308, 312, 315, 318, 330, 342, 348, 350, 354, 366, 372, 378, 385
Offset: 1

Views

Author

Gus Wiseman, Feb 19 2023

Keywords

Comments

A number's (unordered) prime signature (row n of A118914) is the multiset of positive exponents in its prime factorization.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The terms together with their prime indices begin:
    1: {}
    2: {1}
    6: {1,2}
   30: {1,2,3}
   42: {1,2,4}
   49: {4,4}
   60: {1,1,2,3}
   66: {1,2,5}
   70: {1,3,4}
   78: {1,2,6}
   84: {1,1,2,4}
   90: {1,2,2,3}
For example, the prime indices of 2760 are {1,1,1,2,3,9}. The signature is (3,1,1,1), with median 1. The first differences of 0-prepended prime indices are (1,0,0,1,1,6), with median 1/2. So 2760 is not in the sequence.
		

Crossrefs

For distinct prime indices instead of 0-prepended differences: A360453.
For mean instead of median we have A360680.
A112798 = prime indices, length A001222, sum A056239, mean A326567/A326568.
A124010 gives prime signature, sorted A118914, mean A088529/A088530.
A325347 = partitions w/ integer median, strict A359907, complement A307683.
A359893 and A359901 count partitions by median, odd-length A359902.
Multisets with integer median:
- For divisors (A063655) we have A139711, complement A139710.
- For prime indices (A360005) we have A359908, complement A359912.
- For distinct prime indices (A360457) we have A360550, complement A360551.
- For distinct prime factors (A360458) we have A360552, complement A100367.
- For prime factors (A360459) we have A359913, complement A072978.
- For prime multiplicities (A360460) we have A360553, complement A360554.
- For 0-prepended differences (A360555) we have A360556, complement A360557.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],Median[Length/@Split[prix[#]]] == Median[Differences[Prepend[prix[#],0]]]&]

A360691 Number of integer partitions of n with non-integer median of 0-prepended first differences.

Original entry on oeis.org

0, 1, 0, 1, 2, 4, 3, 4, 5, 10, 10, 15, 22, 26, 34, 42, 57, 63, 85, 105, 121, 149, 202, 230, 305, 355, 459, 544, 687, 778, 991, 1130, 1396, 1598, 1947, 2258, 2761, 3143, 3820, 4412, 5330, 6104, 7404, 8499, 10105, 11694, 13922, 15917, 18904, 21646, 25462, 29213
Offset: 1

Views

Author

Gus Wiseman, Feb 22 2023

Keywords

Comments

All of these partitions have even length.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The a(1) = 0 through a(10) = 10 partitions:
  .  (11)  .  (31)  (32)    (33)    (52)    (53)    (54)      (55)
                    (2111)  (51)    (2221)  (71)    (72)      (73)
                            (2211)  (4111)  (3311)  (3222)    (91)
                            (3111)          (5111)  (6111)    (3322)
                                                    (321111)  (3331)
                                                              (4411)
                                                              (5311)
                                                              (7111)
                                                              (322111)
                                                              (421111)
		

Crossrefs

For median 0 we have A360254, ranks A360558.
These partitions have ranks A360557, complement A360556.
The complement is counted by A360688.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A325347 counts partitions with integer median, complement A307683.
A359893 and A359901 count partitions by median, odd-length A359902.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], !IntegerQ[Median[Differences[Prepend[Reverse[#],0]]]]&]],{n,30}]
Previous Showing 11-14 of 14 results.