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.

A035470 Number of ways to break {1,2,3,...,n} into sets with equal sums.

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 6, 12, 11, 2, 80, 166, 2, 665, 2918, 3309, 9296, 23730, 31875, 301030, 422897, 2, 13716867, 71504980, 100664385, 54148591, 880696662, 498017759, 27450476787, 111911522819, 179459955554, 2144502175214, 59115423983, 45837019664552, 375743493787258, 816118711787493, 2, 9492169507922
Offset: 1

Views

Author

Erich Friedman

Keywords

Comments

a(n) = 2 <=> |{d|n*(n+1)/2 : d>=n}| = 2. - Alois P. Heinz, Sep 03 2009

Examples

			a(7) = 6 since we have 1234567, 16/25/34/7, 167/2345, 257/1346, 347/1256, 356/1247.
From _Gus Wiseman_, Jul 13 2019: (Start)
The a(6) = 2 through a(9) = 11 set partitions with equal block-sums:
  {123456}      {1234567}        {12345678}        {123456789}
  {16}{25}{34}  {1247}{356}      {12348}{567}      {12345}{69}{78}
                {1256}{347}      {12357}{468}      {1239}{456}{78}
                {1346}{257}      {12456}{378}      {1248}{357}{69}
                {167}{2345}      {1278}{3456}      {1257}{348}{69}
                {16}{25}{34}{7}  {1368}{2457}      {1347}{258}{69}
                                 {1458}{2367}      {1356}{249}{78}
                                 {1467}{2358}      {159}{2346}{78}
                                 {1236}{48}{57}    {159}{267}{348}
                                 {138}{246}{57}    {168}{249}{357}
                                 {156}{237}{48}    {18}{27}{36}{45}{9}
                                 {18}{27}{36}{45}
(End)

Links

Crossrefs

Cf. A164977, A164978. - Alois P. Heinz, Sep 03 2009
Row sums of A275714.
Row sums of A320438.
Cf. A000110, A007837, A038041, A112956, A275780, A275781, A321455, A326512, A326513, A326518, A326534.

Programs

  • Maple
    with(numtheory): b:= proc() option remember; local i, j, t; `if`(args[1]=0, `if`(nargs=2, 1, b(args[t] $t=2..nargs)), add(`if`(args[j] -args[nargs] <0, 0, b(sort([seq(args[i] -`if`(i=j, args[nargs], 0), i=1..nargs-1)])[], args[nargs]-1)), j=1..nargs-1)) end: a:= proc(n) local i, m, x; m:= n*(n+1)/2; 1+ add(b(i$(m/i), n)/(m/i)!, i=[select(x-> x>=n, divisors(m) minus {m})[]]) end: seq(a(n), n=1..25);  # Alois P. Heinz, Sep 03 2009
  • Mathematica
    b[args_List] := b[args] = If[args[[1]] == 0, If[Length[args] == 2, 1, b[Rest[args]]], Sum[If[args[[j]] - args[[-1]] < 0, 0, b[Sort[Join[Table[ args[[i]] - If[i == j, args[[-1]], 0], {i, 1, Length[args]-1}]]], {args[[-1]]-1}]], {j, 1, Length[args]-1}]]; b[a1_List, a2_List] := b[Join[a1, a2]];
a[n_] := a[n] = With[{m = n*(n+1)/2}, 1+Sum[b[Append[Array[i&, m/i], n]] / (m/i)!, {i, Select[Divisors[m] ~Complement~ {m}, # >= n &]}]];
Table[Print["a(", n, ") = ", a[n]]; a[n], {n, 1, 25}] (* Jean-François Alcover, Mar 22 2017, after Alois P. Heinz *)
sps[{}]:={{}};sps[set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@sps[Complement[set,s]]]/@Cases[Subsets[set],{i,_}];
Table[Length[Select[sps[Range[n]],SameQ@@Total/@#&]],{n,0,10}] (* Gus Wiseman, Jul 13 2019 *)

Extensions

More terms from John W. Layman, Mar 18 2002
a(19)-a(33) from Alois P. Heinz, Sep 03 2009
a(34) from Alois P. Heinz, May 24 2015
a(35)-a(38) from Max Alekseyev, Feb 15 2024

A164977 Numbers m such that the set {1..m} has only one nontrivial decomposition into subsets with equal element sum.

Original entry on oeis.org

3, 4, 5, 6, 10, 13, 22, 37, 46, 58, 61, 73, 82, 106, 157, 166, 178, 193, 226, 262, 277, 313, 346, 358, 382, 397, 421, 457, 466, 478, 502, 541, 562, 586, 613, 661, 673, 718, 733, 757, 838, 862, 877, 886, 982, 997, 1018, 1093, 1153, 1186, 1201, 1213, 1237, 1282
Offset: 1

Views

Author

Alois P. Heinz, Sep 03 2009

Keywords

Comments

Numbers m such that the triangular number T(m) = m*(m+1)/2 has exactly two divisors >= m.
Also numbers m such that m*(m+1)/2 is the product of two primes.
Contains all numbers in A005383. - Harry Richman, Jan 09 2025
Contains all numbers in A077065. - Alois P. Heinz, Jan 19 2025

Examples

			10 is in the sequence, because there is only one nontrivial decomposition of {1..10} into subsets with equal element sum: {1,10}, {2,9}, {3,8}, {4,7}, {5,6}; 11|55.
13 is in the sequence with decomposition of {1..13}: {1,12}, {2,11}, {3,10}, {4,9}, {5,8}, {6,7}, {13}; 13|91.

Links

Crossrefs

Cf. A000217, A001222, A164978, A035470, A068443, A069904, A001358.
Cf. A005383, A077065 (distinct subsequences).

Programs

  • Maple
    a:= proc(n) option remember; local k;
      for k from 1+ `if`(n=1, 2, a(n-1))
      while not (andmap(isprime, [k, (k+1)/2]) or
                 andmap(isprime, [k+1, k/2]))
      do od; k
    end:
seq(a(n), n=1..100);
  • Mathematica
    Select[Range@1304, PrimeOmega[#] + PrimeOmega[# + 1] == 3 &] (* Robert G. Wilson v, Jun 28 2010 and updated Sep 21 2018 *)
  • PARI
    is(n)=if(isprime(n),bigomega(n+1)==2, isprime(n+1) && bigomega(n)==2) \\ Charles R Greathouse IV, Sep 08 2015
  • PARI
    is(n)=if(n%2, isprime((n+1)/2) && isprime(n), isprime(n/2) && isprime(n+1)) \\ Charles R Greathouse IV, Mar 16 2022
  • PARI
    list(lim)=my(v=List()); forprime(p=3,lim, if(isprime((p+1)/2), listput(v,p))); forprime(p=5,lim+1, if(isprime(p\2), listput(v,p-1))); Set(v) \\ Charles R Greathouse IV, Mar 16 2022

Formula

{ m : A035470(m) = 2 }.
{ m : A164978(m) = 2 }.
{ m : |{d|m*(m+1)/2 : d>=m}| = 2 }.
{ m : m*(m+1)/2 in {A068443} }.
{ m : m*(m+1)/2 in {A001358} }.
{ m : A069904(m) = 2 }.
{ m : A001222(n) + A001222(n+1) = 3 }. - Alois P. Heinz, Jan 08 2022
{ A005383 } union { A077065 }. - Alois P. Heinz, Jan 19 2025

A112956 a(n) = number of ways the set {1,2,...,n} can be split into proper subsets with equal sums.

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 5, 11, 10, 1, 79, 165, 1, 664, 2917, 3308, 9295, 23729, 31874, 301029, 422896, 1, 13716866, 71504979, 100664384, 54148590, 880696661, 498017758, 27450476786, 111911522818, 179459955553, 2144502175213, 59115423982, 45837019664551
Offset: 1

Views

Author

Floor van Lamoen, Oct 07 2005

Keywords

Comments

For n=7 we have splittings 761/5432, 752/6431, 743/6521, 7421/653 and 7/61/52/43 so a(7)=5.
a(n) = 1 <=> n*(n+1)/2 is product of two primes. - Alois P. Heinz, Sep 03 2009

Crossrefs

Cf. A035470.
Cf. A164977, A164978. - Alois P. Heinz, Sep 03 2009

Programs

  • Maple
    with(numtheory): b:= proc() option remember; local i, j, t; `if`(args[1]=0, `if`(nargs=2, 1, b(args[t] $t=2..nargs)), add(`if`(args[j] -args[nargs] <0, 0, b(sort([seq(args[i] -`if`(i=j, args[nargs], 0), i=1..nargs-1)])[], args[nargs]-1)), j=1..nargs-1)) end: a:= proc(n) local i, m, x; m:= n*(n+1)/2; add(b(i$(m/i), n)/(m/i)!, i=[select(x-> x>=n, divisors(m) minus {m})[]]) end: seq(a(n), n=1..25);  # Alois P. Heinz, Sep 03 2009
  • Mathematica
    b[args_List] := b[args] = If[args[[1]] == 0, If[Length[args] == 2, 1, b[Rest[args]]], Sum[If[args[[j]] - args[[-1]] < 0, 0, b[Sort[Join[ Table[ args[[i]] - If[i == j, args[[-1]], 0], {i, 1, Length[args] - 1}]]], {args[[-1]] - 1}]], {j, 1, Length[args] - 1}]]; b[a1_List, a2_List] := b[Join[a1, a2]];
a[n_] := a[n] = With[{m = n*(n + 1)/2}, Sum[b[Append[Array[i&, m/i], n]] / (m/i)!, {i, Select[Divisors[m] ~Complement~ {m}, # >= n&]}]];
Table[Print["a(", n, ") = ", a[n]]; a[n], {n, 1, 25}] (* Jean-François Alcover, Mar 22 2017, after Alois P. Heinz *)

Formula

a(n) = A035470(n) - 1. - Franklin T. Adams-Watters, Jun 02 2006

Extensions

More terms from Franklin T. Adams-Watters, Jun 02 2006
a(19)-a(33) from Alois P. Heinz, Sep 03 2009
a(34) from Alois P. Heinz, Aug 06 2016

A320438 Irregular triangle read by rows where T(n,k) is the number of set partitions of {1,...,n} with all block-sums equal to d, where d is the k-th divisor of n*(n+1)/2 that is >= n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 3, 7, 1, 1, 9, 1, 1, 1, 1, 43, 35, 1, 1, 102, 62, 1, 1, 1, 1, 68, 595, 1, 1, 17, 187, 871, 1480, 361, 1, 1, 2650, 657, 1, 1, 9294, 1, 1, 23728, 1, 1, 27763, 4110, 1, 1, 1850, 25035, 108516, 157991, 7636, 1, 1, 11421, 411474, 1
Offset: 1

Views

Author

Gus Wiseman, Jan 08 2019

Keywords

Examples

			Triangle begins:
    1
    1
    1    1
    1    1
    1    1
    1    1
    1    4    1
    1    3    7    1
    1    9    1
    1    1
    1   43   35    1
    1  102   62    1
    1    1
    1   68  595    1
    1   17  187  871 1480  361    1
    1 2650  657    1
Row 8 counts the following set partitions:
  {{18}{27}{36}{45}}  {{1236}{48}{57}}  {{12348}{567}}  {{12345678}}
                      {{138}{246}{57}}  {{12357}{468}}
                      {{156}{237}{48}}  {{12456}{378}}
                                        {{1278}{3456}}
                                        {{1368}{2457}}
                                        {{1458}{2367}}
                                        {{1467}{2358}}

Crossrefs

Row lengths are A164978. Row sums are A035470.
Cf. A000110, A000258, A008277, A112956, A164977, A275714, A279375, A300335, A320423, A320424, A321455, A321469.

Programs

  • Mathematica
    spsu[,{}]:={{}};spsu[foo,set:{i_,_}]:=Join@@Function[s,Prepend[#,s]&/@spsu[Select[foo,Complement[#,Complement[set,s]]=={}&],Complement[set,s]]]/@Cases[foo,{i,_}];
Table[Length[spsu[Select[Subsets[Range[n]],Total[#]==d&],Range[n]]],{n,12},{d,Select[Divisors[n*(n+1)/2],#>=n&]}]

Extensions

More terms from Jinyuan Wang, Feb 27 2025
Name edited by Peter Munn, Mar 06 2025
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.