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-15 of 15 results.

A379844 Squarefree numbers x such that the product of prime indices of x is a multiple of the sum of prime indices of x.

Original entry on oeis.org

2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 30, 31, 37, 41, 43, 47, 53, 59, 61, 65, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 154, 157, 163, 165, 167, 173, 179, 181, 190, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241
Offset: 1

Views

Author

Gus Wiseman, Jan 19 2025

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. The sum and product of prime indices are A056239 and A003963 respectively.

Crossrefs

Squarefree case of A326149.
For nonprime instead of squarefree we have A326150.
The non-prime case is A326158.
Partitions of this type are counted by A379733, see A379735.
The even case is A379845, counted by A380221.
A003963 multiplies together prime indices.
A005117 lists the squarefree numbers.
A056239 adds up prime indices.
Counting and ranking multisets by comparing sum and product:
- same: A001055, ranks A301987
- divisible: A057567, ranks A326155
- divisor: A057568, ranks A326149
- greater than: A096276 shifted right, ranks A325038
- greater or equal: A096276, ranks A325044
- less than: A114324, ranks A325037, see A318029, A379720
- less or equal: A319005, ranks A379721, see A025147
- different: A379736, ranks A379722, see A111133

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[2,100],SquareFreeQ[#]&&Divisible[Times@@prix[#],Plus@@prix[#]]&]

Formula

Satisfies A056239(a(n))|A003963(a(n)).

A324933 Denominator in the division of n by the product of prime indices of n.

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 4, 1, 4, 3, 5, 1, 6, 2, 2, 1, 7, 2, 8, 3, 8, 5, 9, 1, 9, 3, 8, 1, 10, 1, 11, 1, 10, 7, 12, 1, 12, 4, 4, 3, 13, 4, 14, 5, 4, 9, 15, 1, 16, 9, 14, 3, 16, 4, 3, 1, 16, 5, 17, 1, 18, 11, 16, 1, 18, 5, 19, 7, 6, 6, 20, 1, 21, 6, 6, 2, 20, 2, 22, 3
Offset: 1

Views

Author

Gus Wiseman, Mar 21 2019

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 sequence of quotients n/A003963(n) begins: 1, 2, 3/2, 4, 5/3, 3, 7/4, 8, 9/4, 10/3, 11/5, 6, 13/6, 7/2, 5/2, 16, ...
		

Crossrefs

Programs

  • Mathematica
    Table[n/Times@@Cases[If[n==1,{},FactorInteger[n]],{p_,k_}:>PrimePi[p]^k],{n,100}]//Denominator

A324932 Numerator in the division of n by the product of prime indices of n.

Original entry on oeis.org

1, 2, 3, 4, 5, 3, 7, 8, 9, 10, 11, 6, 13, 7, 5, 16, 17, 9, 19, 20, 21, 22, 23, 12, 25, 13, 27, 7, 29, 5, 31, 32, 33, 34, 35, 9, 37, 19, 13, 40, 41, 21, 43, 44, 15, 46, 47, 24, 49, 50, 51, 26, 53, 27, 11, 14, 57, 29, 59, 10, 61, 62, 63, 64, 65, 33, 67, 68, 23
Offset: 1

Views

Author

Gus Wiseman, Mar 21 2019

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 sequence of quotients n/A003963(n) begins: 1, 2, 3/2, 4, 5/3, 3, 7/4, 8, 9/4, 10/3, 11/5, 6, 13/6, 7/2, 5/2, 16, ...
		

Crossrefs

Programs

  • Mathematica
    Table[n/Times@@Cases[If[n==1,{},FactorInteger[n]],{p_,k_}:>PrimePi[p]^k],{n,100}]//Numerator

A330952 Number of integer partitions of n whose Heinz number (product of primes of parts) is divisible by all parts.

Original entry on oeis.org

1, 1, 1, 2, 2, 3, 5, 6, 8, 11, 14, 20, 25, 32, 42, 54, 69, 87, 109, 137, 172, 215, 269, 331, 409, 499, 612, 751, 917, 1111, 1344, 1626, 1963, 2359, 2834, 3396, 4065, 4849, 5779, 6865, 8146, 9658, 11424, 13483, 15898, 18710, 21999, 25823, 30272, 35417, 41397
Offset: 0

Views

Author

Gus Wiseman, Jan 15 2020

Keywords

Comments

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k). This gives a bijective correspondence between positive integers and integer partitions.

Examples

			The a(1) = 1 through a(9) = 11 partitions:
  1  11  21   211   221    321     2221     3221      621
         111  1111  2111   411     3211     4211      3321
                    11111  2211    4111     22211     22221
                           21111   22111    32111     32211
                           111111  211111   41111     42111
                                   1111111  221111    222111
                                            2111111   321111
                                            11111111  411111
                                                      2211111
                                                      21111111
                                                      111111111
		

Crossrefs

The Heinz numbers of these partitions are given by A120383.
Partitions whose product is divisible by their sum are A057568.
Partitions whose Heinz number is divisible by their product are A324925.
Partitions whose Heinz number is divisible by their sum are A330950.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],And@@Table[Divisible[Times@@Prime/@#,i],{i,#}]&]],{n,0,30}]

A340829 Number of strict integer partitions of n whose Heinz number (product of primes of parts) is divisible by n.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 2, 0, 0, 2, 3, 0, 4, 3, 4, 0, 8, 0, 10, 0, 11, 12, 19, 0, 0, 22, 0, 0, 46, 23, 56, 0, 64, 66, 86, 0, 125, 104, 135, 0, 196, 111, 230, 0, 0, 274, 353, 0, 0, 0, 563, 0, 687, 0, 974, 0, 1039, 1052, 1290, 0, 1473, 1511, 0, 0, 2707, 1614, 2664, 0
Offset: 1

Views

Author

Gus Wiseman, Feb 01 2021

Keywords

Comments

The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), giving a bijective correspondence between positive integers and integer partitions. The Heinz numbers of these partitions are squarefree numbers divisible by the sum of their prime indices.

Examples

			The a(6) = 1 through a(19) = 10 partitions (empty columns indicated by dots, A = 10, B = 11):
  321  43   .  .  631   65    .  76    941   A32    .  A7     .  B8
       421        4321  542      643   6431  6432      764       865
                        5321     652   7421  9321      872       874
                                 6421        54321     971       982
                                                       7532      A81
                                                       7541      8542
                                                       7631      8632
                                                       74321     8641
                                                                 8731
                                                                 85321
		

Crossrefs

Note: A-numbers of Heinz-number sequences are in parentheses below.
Positions of zeros are 2 and A013929.
The non-strict version is A330950 (A324851) q.v.
A000009 counts strict partitions.
A003963 multiplies together prime indices.
A018818 counts partitions into divisors (A326841).
A047993 counts balanced partitions (A106529).
A056239 adds up prime indices.
A057568 counts partitions whose product is divisible by their sum (A326149).
A067538 counts partitions whose length/max divides sum (A316413/A326836).
A072233 counts partitions by sum and length, with strict case A008289.
A102627 counts strict partitions whose length divides sum.
A112798 lists the prime indices of each positive integer.
A120383 lists numbers divisible by all of their prime indices.
A324850 lists numbers divisible by the product of their prime indices.
A324925 counts partitions whose Heinz number is divisible by their product.
A326842 counts partitions whose parts and length all divide sum (A326847).
A326850 counts strict partitions whose maximum part divides sum.
A326851 counts strict partitions with length and maximum dividing sum.
A330952 counts partitions whose Heinz number is divisible by all parts.
A340828 counts strict partitions with length divisible by maximum.
A340830 counts strict partitions with parts divisible by length.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Divisible[Times@@Prime/@#,n]&]],{n,30}]
Previous Showing 11-15 of 15 results.