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.

A340832 Number of factorizations of n into factors > 1 with odd least factor.

Original entry on oeis.org

0, 0, 1, 0, 1, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 1, 1, 1, 0, 2, 0, 1, 1, 2, 0, 3, 0, 1, 2, 1, 0, 2, 0, 2, 2, 1, 0, 2, 1, 1, 1, 1, 0, 4, 0, 1, 2, 2, 1, 2, 0, 1, 2, 2, 1, 2, 0, 1, 3, 1, 0, 4, 0, 2, 1, 1, 0, 2, 2, 1, 3, 1, 0, 4, 0, 2, 1, 1, 1, 5, 0, 1, 3, 2, 0, 2, 0, 1, 5, 2, 0, 2, 0, 2, 2, 1, 1, 4, 1, 1, 1, 1, 0, 5, 0, 1, 6
Offset: 1

Views

Author

Gus Wiseman, Feb 04 2021

Keywords

Examples

			The a(n) factorizations for n = 45, 108, 135, 180, 252:
  (45)     (3*36)     (135)      (3*60)     (3*84)
  (5*9)    (9*12)     (3*45)     (5*36)     (7*36)
  (3*15)   (3*4*9)    (5*27)     (9*20)     (9*28)
  (3*3*5)  (3*6*6)    (9*15)     (5*6*6)    (3*3*28)
           (3*3*12)   (3*5*9)    (3*3*20)   (3*4*21)
           (3*3*3*4)  (3*3*15)   (3*4*15)   (3*6*14)
                      (3*3*3*5)  (3*5*12)   (3*7*12)
                                 (3*6*10)   (3*3*4*7)
                                 (3*3*4*5)
		

Crossrefs

Positions of 0's are A340854.
Positions of nonzero terms are A340855.
The version for partitions is A026804.
Odd-length factorizations are counted by A339890.
The version looking at greatest factor is A340831.
- Factorizations -
A001055 counts factorizations.
A045778 counts strict factorizations.
A316439 counts factorizations by product and length.
A340101 counts factorizations into odd factors, odd-length case A340102.
A340607 counts factorizations with odd length and greatest factor.
A340653 counts balanced factorizations.
- Odd -
A000009 counts partitions into odd parts.
A026424 lists numbers with odd Omega.
A027193 counts partitions of odd length.
A058695 counts partitions of odd numbers (A300063).
A066208 lists numbers with odd-indexed prime factors.
A067659 counts strict partitions of odd length (A030059).
A174726 counts ordered factorizations of odd length.
A244991 lists numbers whose greatest prime index is odd.
A340692 counts partitions of odd rank.

Programs

  • Mathematica
    facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
    Table[Length[Select[facs[n],OddQ@*Min]],{n,100}]
  • PARI
    A340832(n, m=n, fc=1) = if(1==n, (m%2)&&!fc, my(s=0); fordiv(n, d, if((d>1)&&(d<=m), s += A340832(n/d, d, 0*fc))); (s)); \\ Antti Karttunen, Dec 13 2021

Extensions

Data section extended up to 108 terms by Antti Karttunen, Dec 13 2021