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.

Showing 1-4 of 4 results.

A317828 Record values in A317826.

Original entry on oeis.org

1, 2, 4, 5, 11, 26, 52, 92, 198, 249, 560, 1311, 2776, 6367, 14086, 21007, 48034, 56031, 131781, 317515, 695541, 804219, 2011535, 4555083, 8040378, 18688105, 25235398, 59995537, 68141074, 165243129, 407951724, 927908528
Offset: 1

Views

Author

Antti Karttunen, Aug 10 2018

Keywords

Crossrefs

Cf. A317826, A317827, A317829 (a subsequence).

Formula

a(n) = A317826(A317827(n)).

A317827 Positions of records in A317826, computed from its term A317826(1) = 1 onward.

Original entry on oeis.org

1, 3, 5, 9, 11, 17, 23, 41, 47, 65, 71, 95, 119, 215, 239, 335, 359, 455, 479, 599, 719, 1199, 1319, 1439, 2039, 2159, 2759, 2879, 3479, 3599, 4319, 5039
Offset: 1

Views

Author

Antti Karttunen, Aug 10 2018

Keywords

Crossrefs

Cf. A317826, A317828 gives the record values.
Cf. A033312 (a subsequence apart from zeros).

A317829 Number of set partitions of multiset {1, 2, 2, 3, 3, 3, ..., n X n}.

Original entry on oeis.org

1, 1, 4, 52, 2776, 695541, 927908528, 7303437156115, 371421772559819369, 132348505150329265211927, 355539706668772869353964510735, 7698296698535929906799439134946965681, 1428662247641961794158621629098030994429958386, 2405509035205023556420199819453960482395657232596725626
Offset: 0

Views

Author

Antti Karttunen, Aug 10 2018

Keywords

Comments

Number of factorizations of the superprimorial A006939(n) into factors > 1. - Gus Wiseman, Aug 21 2020

Examples

			For n = 2 we have a multiset {1, 2, 2} which can be partitioned as {{1}, {2}, {2}} or {{1, 2}, {2}} or {{1}, {2, 2}} or {{1, 2, 2}}, thus a(2) = 4.
		

Crossrefs

Subsequence of A317828.
A000142 counts submultisets of the same multiset.
A022915 counts permutations of the same multiset.
A337069 is the strict case.
A001055 counts factorizations.
A006939 lists superprimorials or Chernoff numbers.
A076716 counts factorizations of factorials.
A076954 can be used instead of A006939 (cf. A307895, A325337).
A181818 lists products of superprimorials, with complement A336426.

Programs

  • Maple
    g:= proc(n, k) option remember; uses numtheory; `if`(n>k, 0, 1)+
         `if`(isprime(n), 0, add(`if`(d>k or max(factorset(n/d))>d, 0,
            g(n/d, d)), d=divisors(n) minus {1, n}))
        end:
    a:= n-> g(mul(ithprime(i)^i, i=1..n)$2):
    seq(a(n), n=0..5);  # Alois P. Heinz, Jul 26 2020
  • Mathematica
    chern[n_]:=Product[Prime[i]^(n-i+1),{i,n}];
    facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];
    Table[Length[facs[chern[n]]],{n,3}] (* Gus Wiseman, Aug 21 2020 *)
  • PARI
    \\ See A318284 for count.
    a(n) = {if(n==0, 1, count(vector(n,i,i)))} \\ Andrew Howroyd, Aug 31 2020

Formula

a(n) = A317826(A033312(n+1)) = A317826((n+1)!-1) = A001055(A076954(n)).
a(n) = A001055(A006939(n)). - Gus Wiseman, Aug 21 2020
a(n) = A318284(A002110(n)). - Andrew Howroyd, Aug 31 2020

Extensions

a(0)=1 prepended and a(7) added by Alois P. Heinz, Jul 26 2020
a(8)-a(13) from Andrew Howroyd, Aug 31 2020

A317836 Number of partitions of n with carry-free sum in primorial base.

Original entry on oeis.org

1, 1, 1, 2, 2, 4, 1, 2, 2, 5, 4, 11, 2, 4, 4, 11, 9, 26, 3, 7, 7, 21, 16, 52, 5, 12, 12, 38, 29, 98, 1, 2, 2, 5, 4, 11, 2, 5, 5, 15, 11, 36, 4, 11, 11, 36, 26, 92, 7, 21, 21, 74, 52, 198, 12, 38, 38, 141, 98, 392, 2, 4, 4, 11, 9, 26, 4, 11, 11, 36, 26, 92, 9, 26, 26, 92, 66, 249, 16, 52, 52, 198, 137, 560, 29, 98, 98, 392, 269, 1150, 3, 7
Offset: 0

Views

Author

Antti Karttunen, Aug 08 2018

Keywords

Comments

"Carry-free sum" in this context means that when the digits of summands (written in primorial base, see A049345) are lined up (right-justified), then summing up of each column will not result in carries to any columns left of that column, that is, the sum of digits of the k-th column from the right (with the rightmost as column 1) over all the summands is the same as the k-th digit in n, thus at most prime(k)-1. Among other things, this implies that in any solution, at most one of the summands may be odd. Moreover, such an odd summand is present if and only if n is odd.

Examples

			For n=24, A049345(24) = "400" as 24 = 4*A002110(2) + 0*A002110(1) + 0*A002110(0). This can be partitioned in carry-free way either as "100" + "100" + "100" + "100" {6+6+6+6}, "200" + "100" + "100" {12+6+6}, "200" + "200" {12+12}, "300" + "100" {18+6}, or "400" {24}, thus a(24) = 5.
For n=0..23, A049345(n) = A007623(n), thus a(n) = A317826(n) in the same range. See the examples in the latter sequence for how the values for n=0..5 are formed.
		

Crossrefs

Programs

  • PARI
    fcnt(n, m) = {local(s); s=0; if(n == 1, s=1, fordiv(n, d, if(d > 1 & d <= m, s=s+fcnt(n/d, d)))); s};
    A001055(n) = fcnt(n, n); \\ From A001055
    A276086(n) = { my(i=0,m=1,pr=1,nextpr); while((n>0),i=i+1; nextpr = prime(i)*pr; if((n%nextpr),m*=(prime(i)^((n%nextpr)/pr));n-=(n%nextpr));pr=nextpr); m; };
    A317836(n) = A001055(A276086(n));
    
  • PARI
    \\ Slightly faster, memoized implementation:
    memA001055 = Map();
    A001055(n) = {my(v); if(mapisdefined(memA001055,n), v = mapget(memA001055,n), v = fcnt(n, n); mapput(memA001055,n,v); (v));}; \\ Cached version.
    A046523(n) = { my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]); };  \\ From A046523
    A317836(n) = A001055(A046523(A276086(n)));

Formula

a(n) = A001055(A276086(n)) = A001055(A278226(n)).
Showing 1-4 of 4 results.