login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A327518 Number of factorizations of A302696(n), the n-th number that is 1, 2, or a nonprime number with pairwise coprime prime indices, into factors > 1 satisfying the same conditions. 0
1, 1, 2, 1, 3, 1, 2, 1, 1, 5, 2, 1, 4, 1, 2, 2, 7, 1, 1, 1, 1, 4, 2, 1, 7, 1, 2, 1, 4, 1, 5, 1, 11, 2, 2, 1, 2, 1, 2, 1, 7, 1, 1, 1, 4, 2, 1, 1, 1, 12, 2, 4, 1, 2, 7, 2, 1, 1, 10, 1, 1, 2, 15, 5, 1, 4, 2, 5, 1, 1, 1, 1, 1, 2, 4, 2, 1, 1, 12, 1, 2, 1, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
EXAMPLE
The a(59) = 10 factorizations of 120 using the allowed factors, together with the corresponding multiset partitions of {1,1,1,2,3}:
(2*2*2*15) {{1},{1},{1},{2,3}}
(2*2*30) {{1},{1},{1,2,3}}
(2*4*15) {{1},{1,1},{2,3}}
(2*6*10) {{1},{1,2},{1,3}}
(2*60) {{1},{1,1,2,3}}
(4*30) {{1,1},{1,2,3}}
(6*20) {{1,2},{1,1,3}}
(8*15) {{1,1,1},{2,3}}
(10*12) {{1,3},{1,1,2}}
(120) {{1,1,1,2,3}}
MATHEMATICA
nn=100;
facsusing[s_, n_]:=If[n<=1, {{}}, Join@@Table[Map[Prepend[#, d]&, Select[facsusing[Select[s, Divisible[n/d, #]&], n/d], Min@@#>=d&]], {d, Select[s, Divisible[n, #]&]}]];
y=Select[Range[nn], #==1||CoprimeQ@@primeMS[#]&];
Table[Length[facsusing[Rest[y], n]], {n, y}]
CROSSREFS
See link for additional cross-references.
Sequence in context: A366833 A353161 A327533 * A174532 A089242 A349258
KEYWORD
nonn
AUTHOR
Gus Wiseman, Sep 19 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 23:26 EDT 2024. Contains 371917 sequences. (Running on oeis4.)