A352143 -id:A352143 - cp's OEIS frontend

A366528 Sum of odd prime indices of n.

0, 1, 0, 2, 3, 1, 0, 3, 0, 4, 5, 2, 0, 1, 3, 4, 7, 1, 0, 5, 0, 6, 9, 3, 6, 1, 0, 2, 0, 4, 11, 5, 5, 8, 3, 2, 0, 1, 0, 6, 13, 1, 0, 7, 3, 10, 15, 4, 0, 7, 7, 2, 0, 1, 8, 3, 0, 1, 17, 5, 0, 12, 0, 6, 3, 6, 19, 9, 9, 4, 0, 3, 21, 1, 6, 2, 5, 1, 0, 7, 0, 14, 23, 2

Offset: 1

Gus Wiseman, Oct 22 2023

nonn

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, sum A056239(n).

			The prime indices of 198 are {1,2,2,5}, so a(198) = 1+5 = 6.

Zeros are A066207, counted by A035363.
The triangle for this rank statistic is A113685, without zeros A365067.
For count instead of sum we have A257991, even A257992.
Nonzeros are A366322, counted by A086543.
The even version is A366531, halved A366533, triangle A113686.
A000009 counts partitions into odd parts, ranks A066208.
A053253 = partitions with all odd parts and conjugate parts, ranks A352143.
A066967 adds up sums of odd parts over all partitions.
A112798 lists prime indices, reverse A296150, length A001222, sum A056239.
A162641 counts even prime exponents, odd A162642.
A352142 = odd indices with odd exponents, counted by A117958.
Cf. A000720, A055396, A130780, A171966, A174713, A325698, A325700, A366748.

Table[Total[Cases[FactorInteger[n], {p_?(OddQ@*PrimePi),k_}:>PrimePi[p]*k]],{n,100}]

a(n) = A056239(n) - A366531(n).

A053253 Coefficients of the '3rd-order' mock theta function omega(q).

Original entry on oeis.org

1, 2, 3, 4, 6, 8, 10, 14, 18, 22, 29, 36, 44, 56, 68, 82, 101, 122, 146, 176, 210, 248, 296, 350, 410, 484, 566, 660, 772, 896, 1038, 1204, 1391, 1602, 1846, 2120, 2428, 2784, 3182, 3628, 4138, 4708, 5347, 6072, 6880, 7784, 8804, 9940, 11208, 12630

Offset: 0

Dean Hickerson, Dec 19 1999

Empirical: a(n) is the number of integer partitions mu of 2n+1 such that the diagram of mu has an odd number of cells in each row and in each column. - John M. Campbell, Apr 24 2020
From Gus Wiseman, Jun 26 2022: (Start)
By Campbell's conjecture above that a(n) is the number of partitions of 2n+1 with all odd parts and all odd conjugate parts, the a(0) = 1 through a(5) = 8 partitions are (B = 11):
  (1)  (3)    (5)      (7)        (9)          (B)
       (111)  (311)    (511)      (333)        (533)
              (11111)  (31111)    (711)        (911)
                       (1111111)  (51111)      (33311)
                                  (3111111)    (71111)
                                  (111111111)  (5111111)
                                               (311111111)
                                               (11111111111)
These partitions are ranked by A352143. (End)

Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988, pp. 15, 17, 31.

Vaclav Kotesovec, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Seiichi Manyama)
Steven Charlton, Explicit linear dependence congruence relations for the partition function modulo 4, arXiv:2412.17459 [math.NT], 2024. See p. 3.
Leila A. Dragonette, Some asymptotic formulas for the mock theta series of Ramanujan, Trans. Amer. Math. Soc., 72 (1952) 474-500.
John F. R. Duncan, Michael J. Griffin and Ken Ono, Proof of the Umbral Moonshine Conjecture, arXiv:1503.01472 [math.RT], 2015.
George N. Watson, The final problem: an account of the mock theta functions, J. London Math. Soc., 11 (1936) 55-80.

Other '3rd-order' mock theta functions are at A000025, A053250, A053251, A053252, A053254, A053255, A261401.
Cf. A095913(n)=a(n-3).
Cf. A259094.
Conjectured to count the partitions ranked by A352143.
A069911 = strict partitions w/ all odd parts, ranked by A258116.
A078408 = partitions w/ all odd parts, ranked by A066208.
A117958 = partitions w/ all odd parts and multiplicities, ranked by A352142.
Cf. A000009, A000290, A000701, A035363 (complement A086543), A035444, A035457, A045931, A055922, A258117.

Series[Sum[q^(2n(n+1))/Product[1-q^(2k+1), {k, 0, n}]^2, {n, 0, 6}], {q, 0, 100}]

{a(n)=local(A); if(n<0, 0, A=1+x*O(x^n); polcoeff( sum(k=0, (sqrtint(2*n+1)-1)\2, A*=(x^(4*k)/(1-x^(2*k+1))^2 +x*O(x^(n-2*(k^2-k))))), n))} /* Michael Somos, Aug 18 2006 */

{a(n)=local(A); if(n<0, 0, n++; A=1+x*O(x^n); polcoeff( sum(k=0, n-1, A*=(x/(1-x^(2*k+1)) +x*O(x^(n-k)))), n))} /* Michael Somos, Aug 18 2006 */

G.f.: omega(q) = Sum_{n>=0} q^(2*n*(n+1))/((1-q)*(1-q^3)*...*(1-q^(2*n+1)))^2.
G.f.: Sum_{k>=0} x^k/((1-x)(1-x^3)...(1-x^(2k+1))). - Michael Somos, Aug 18 2006
G.f.: (1 - G(0))/(1-x) where G(k) = 1 - 1/(1-x^(2*k+1))/(1-x/(x-1/G(k+1) )); (continued fraction). - Sergei N. Gladkovskii, Jan 18 2013
a(n) ~ exp(Pi*sqrt(n/3)) / (4*sqrt(n)). - Vaclav Kotesovec, Jun 10 2019
Conjectural g.f.: 1/(1 - x)*( 1 + Sum_{n >= 0} x^(3*n+1) /((1 - x)*(1 - x^3)*...*(1 - x^(2*n+1))) ). - Peter Bala, Nov 18 2024

A352142 Numbers whose prime factorization has all odd indices and all odd exponents.

Original entry on oeis.org

1, 2, 5, 8, 10, 11, 17, 22, 23, 31, 32, 34, 40, 41, 46, 47, 55, 59, 62, 67, 73, 82, 83, 85, 88, 94, 97, 103, 109, 110, 115, 118, 125, 127, 128, 134, 136, 137, 146, 149, 155, 157, 160, 166, 167, 170, 179, 184, 187, 191, 194, 197, 205, 206, 211, 218, 227, 230

Offset: 1

Gus Wiseman, Mar 18 2022

nonn

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, sum A056239, length A001222.
A number's prime signature is the sequence of positive exponents in its prime factorization, which is row n of A124010, length A001221, sum A001222.
These are the Heinz numbers of integer partitions with all odd parts and all odd multiplicities, counted by A117958.

			The terms together with their prime indices begin:
   1 = 1
   2 = prime(1)
   5 = prime(3)
   8 = prime(1)^3
  10 = prime(1) prime(3)
  11 = prime(5)
  17 = prime(7)
  22 = prime(1) prime(5)
  23 = prime(9)
  31 = prime(11)
  32 = prime(1)^5
  34 = prime(1) prime(7)
  40 = prime(1)^3 prime(3)

David A. Corneth, Table of n, a(n) for n = 1..10000

The restriction to primes is A031368.
The first condition alone is A066208, counted by A000009.
These partitions are counted by A117958.
The squarefree case is A258116, even A258117.
The second condition alone is A268335, counted by A055922.
The even-even version is A352141 counted by A035444.
A000290 = exponents all even, counted by A035363.
A056166 = exponents all prime, counted by A055923.
A066207 = indices all even, counted by A035363 (complement A086543).
A109297 = same indices as exponents, counted by A114640.
A112798 lists prime indices, reverse A296150, length A001222, sum A056239.
A124010 gives prime signature, sorted A118914, length A001221, sum A001222.
A162641 counts even prime exponents, odd A162642.
A257991 counts odd prime indices, even A257992.
A325131 = disjoint indices from exponents, counted by A114639.
A346068 = indices and exponents all prime, counted by A351982.
A351979 = odd indices with even exponents, counted by A035457.
A352140 = even indices with odd exponents, counted by A055922 aerated.
A352143 = odd indices with odd conjugate indices, counted by A053253 aerated.
Cf. A000720, A028260, A055396, A061395, A106529, A181819, A195017, A241638, A276078, A324517, A324524, A324525, A325698, A325700.

Select[Range[100],#==1||And@@OddQ/@PrimePi/@First/@FactorInteger[#]&&And@@OddQ/@Last/@FactorInteger[#]&]

from itertools import count, islice
from sympy import primepi, factorint
def A352142_gen(startvalue=1): # generator of terms >= startvalue
    return filter(lambda k:all(map(lambda x:x[1]%2 and primepi(x[0])%2, factorint(k).items())),count(max(startvalue,1)))
A352142_list = list(islice(A352142_gen(),30)) # Chai Wah Wu, Mar 18 2022

Intersection of A066208 and A268335.
A257991(a(n)) = A001222(a(n)).
A162642(a(n)) = A001221(a(n)).
A257992(a(n)) = A162641(a(n)) = 0.

A352141 Numbers whose prime factorization has all even indices and all even exponents.

Original entry on oeis.org

1, 9, 49, 81, 169, 361, 441, 729, 841, 1369, 1521, 1849, 2401, 2809, 3249, 3721, 3969, 5041, 6241, 6561, 7569, 7921, 8281, 10201, 11449, 12321, 12769, 13689, 16641, 17161, 17689, 19321, 21609, 22801, 25281, 26569, 28561, 29241, 29929, 32761, 33489, 35721

Offset: 1

Gus Wiseman, Mar 18 2022

nonn

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, sum A056239, length A001222.
A number's prime signature is the sequence of positive exponents in its prime factorization, which is row n of A124010, length A001221, sum A001222.
These are the Heinz numbers of partitions with all even parts and all even multiplicities, counted by A035444.

			The terms together with their prime indices begin:
     1 = 1
     9 = prime(2)^2
    49 = prime(4)^2
    81 = prime(2)^4
   169 = prime(6)^2
   361 = prime(8)^2
   441 = prime(2)^2 prime(4)^2
   729 = prime(2)^6
   841 = prime(10)^2
  1369 = prime(12)^2
  1521 = prime(2)^2 prime(6)^2
  1849 = prime(14)^2
  2401 = prime(4)^4
  2809 = prime(16)^2
  3249 = prime(2)^2 prime(8)^2
  3721 = prime(18)^2
  3969 = prime(2)^4 prime(4)^2

Amiram Eldar, Table of n, a(n) for n = 1..10000

The second condition alone (all even exponents) is A000290, counted by A035363.
The restriction to primes is A031215.
These partitions are counted by A035444.
The first condition alone is A066207, counted by A035363, squarefree A258117.
A056166 = exponents all prime, counted by A055923.
A066208 = prime indices all odd, counted by A000009.
A109297 = same indices as exponents, counted by A114640.
A112798 lists prime indices, reverse A296150, length A001222, sum A056239.
A124010 gives prime signature, sorted A118914, length A001221, sum A001222.
A162641 counts even exponents, odd A162642.
A257991 counts odd indices, even A257992.
A325131 = disjoint indices from exponents, counted by A114639.
A346068 = indices and exponents all prime, counted by A351982.
A351979 = odd indices with even exponents, counted by A035457.
A352140 = even indices with odd exponents, counted by A055922 aerated.
A352142 = odd indices with odd exponents, counted by A117958.
Cf. A000720, A028260, A055396, A061395, A181819, A195017, A241638, A268335, A276078, A324524, A324525, A324588, A325698, A325700, A352143.

Select[Range[1000],#==1||And@@EvenQ/@PrimePi/@First/@FactorInteger[#]&&And@@EvenQ/@Last/@FactorInteger[#]&]

from itertools import count, islice
from sympy import factorint, primepi
def A352141_gen(startvalue=1): # generator of terms >= startvalue
    return filter(lambda k:all(map(lambda x: not (x[1]%2 or primepi(x[0])%2), factorint(k).items())),count(max(startvalue,1)))
A352141_list = list(islice(A352141_gen(),30)) # Chai Wah Wu, Mar 18 2022

Intersection of A000290 and A066207.
A257991(a(n)) = A162642(a(n)) = 0.
A257992(a(n)) = A001222(a(n)).
A162641(a(n)) = A001221(a(n)).
Sum_{n>=1} 1/a(n) = 1/Product_{k>=1} (1 - 1/prime(2*k)^2) = 1.163719... . - Amiram Eldar, Sep 19 2022

cp's OEIS Frontend

A366528 Sum of odd prime indices of n.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A053253 Coefficients of the '3rd-order' mock theta function omega(q).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A352142 Numbers whose prime factorization has all odd indices and all odd exponents.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula

A352141 Numbers whose prime factorization has all even indices and all even exponents.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Python

Formula