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!)
A336942 Number of strict chains of divisors in A130091 (numbers with distinct prime multiplicities) starting with the superprimorial A006939(n) and ending with 1. 7
1, 1, 5, 95, 8823, 4952323, 20285515801, 714092378624317 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = A336423(A006939(n)) = A336571(A006939(n)).
EXAMPLE
The a(0) = 1 through a(2) = 5 chains:
{1} {2,1} {12,1}
{12,2,1}
{12,3,1}
{12,4,1}
{12,4,2,1}
MATHEMATICA
chern[n_]:=Product[Prime[i]^(n-i+1), {i, n}];
chnstr[n_]:=If[n==1, 1, Sum[chnstr[d], {d, Select[Most[Divisors[n]], UnsameQ@@Last/@FactorInteger[#]&]}]];
Table[chnstr[chern[n]], {n, 0, 3}]
CROSSREFS
A076954 can be used instead of A006939 (cf. A307895, A325337).
A336423 and A336571 are not restricted to A006939.
A336941 is the version not restricted by A130091.
A337075 is the version for factorials.
A074206 counts chains of divisors from n to 1.
A130091 lists numbers with distinct prime multiplicities.
A181796 counts divisors with distinct prime multiplicities.
A253249 counts chains of divisors.
A327498 gives the maximum divisor with distinct prime multiplicities.
A336422 counts divisible pairs of divisors, both in A130091.
A336424 counts factorizations using A130091.
Sequence in context: A182960 A241998 A263394 * A193478 A218463 A192343
KEYWORD
nonn,more
AUTHOR
Gus Wiseman, Aug 14 2020
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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)