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-10 of 12 results. Next

A339195 Triangle of squarefree numbers grouped by greatest prime factor, read by rows.

Original entry on oeis.org

1, 2, 3, 6, 5, 10, 15, 30, 7, 14, 21, 35, 42, 70, 105, 210, 11, 22, 33, 55, 66, 77, 110, 154, 165, 231, 330, 385, 462, 770, 1155, 2310, 13, 26, 39, 65, 78, 91, 130, 143, 182, 195, 273, 286, 390, 429, 455, 546, 715, 858, 910, 1001, 1365, 1430, 2002, 2145, 2730, 3003, 4290, 5005, 6006, 10010, 15015, 30030
Offset: 0

Views

Author

Gus Wiseman, Dec 02 2020

Keywords

Comments

Also Heinz numbers of subsets of {1..n} that contain n if n>0, where the Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k).
A019565 in its triangle form, with each row's terms in increasing order. - Peter Munn, Feb 26 2021
From David James Sycamore, Jan 09 2025: (Start)
Alternative definition, with offset = 1: a(1) = 1. For n>1 if a(n-1) = A002110(k), a(n) = prime(k+1). Otherwise a(n) is the smallest novel squarefree number whose prime factors have already occurred as previous terms.
Permutation of A005117, Squarefree version A379746. (End)

Examples

			Triangle begins:
   1
   2
   3   6
   5  10  15  30
   7  14  21  35  42  70  105  210
		

Crossrefs

A011782 gives row lengths.
A339360 gives row sums.
A008578 (shifted) is column k = 1.
A100484 is column k = 2.
A001748 is column k = 3.
A002110 is column k = 2^(n-1).
A070826 is column k = 2^(n-1) - 1.
A209862 takes prime indices to binary indices in these terms.
A246867 groups squarefree numbers by Heinz weight, with row sums A147655.
A261144 divides the n-th row by prime(n), with row sums A054640.
A339116 is the restriction to semiprimes, with row sums A339194.
A005117 lists squarefree numbers, ordered lexicographically by prime factors: A019565.
A006881 lists squarefree semiprimes.
A072047 counts prime factors of squarefree numbers.
A319246 is the sum of prime indices of the n-th squarefree number.
A329631 lists prime indices of squarefree numbers, reversed: A319247.
A338899/A270650/A270652 give the prime indices of squarefree semiprimes.
Cf. A379746.

Programs

  • Maple
    T:= proc(n) option remember; `if`(n=0, 1, (p-> map(
          x-> x*p, {seq(T(i), i=0..n-1)})[])(ithprime(n)))
        end:
    seq(T(n), n=0..6);  # Alois P. Heinz, Jan 08 2025
  • Mathematica
    Table[Prime[n]*Sort[Times@@Prime/@#&/@Subsets[Range[n-1]]],{n,5}]

Formula

For n > 1, T(n,k) = prime(n) * A261144(n-1,k).
a(n) = A019565(A379770(n)). - Michael De Vlieger, Jan 08 2025

Extensions

Row n=0 (term 1) prepended by Alois P. Heinz, Jan 08 2025

A261144 Irregular triangle of numbers that are squarefree and smooth (row n contains squarefree p-smooth numbers, where p is the n-th prime).

Original entry on oeis.org

1, 2, 1, 2, 3, 6, 1, 2, 3, 5, 6, 10, 15, 30, 1, 2, 3, 5, 6, 7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210, 1, 2, 3, 5, 6, 7, 10, 11, 14, 15, 21, 22, 30, 33, 35, 42, 55, 66, 70, 77, 105, 110, 154, 165, 210, 231, 330, 385, 462, 770, 1155, 2310, 1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 21, 22, 26, 30, 33, 35, 39, 42
Offset: 1

Views

Author

Jean-François Alcover, Nov 26 2015

Keywords

Comments

If we define a triangle whose n-th row consists of all squarefree numbers whose prime factors are all less than prime(k), we get this same triangle except starting with a row {1}, with offset 1. - Gus Wiseman, Aug 24 2021

Examples

			Triangle begins:
1, 2;                        squarefree and 2-smooth
1, 2, 3, 6;                  squarefree and 3-smooth
1, 2, 3, 5, 6, 10, 15, 30;
1, 2, 3, 5, 6,  7, 10, 14, 15, 21, 30, 35, 42, 70, 105, 210;
...
		

Crossrefs

Cf. A000079 (2-smooth), A003586 (3-smooth), A051037 (5-smooth), A002473 (7-smooth), A018336 (7-smooth & squarefree), A051038 (11-smooth), A087005 (11-smooth & squarefree), A080197 (13-smooth), A087006 (13-smooth & squarefree), A087007 (17-smooth & squarefree), A087008 (19-smooth & squarefree).
Row lengths are A000079.
Rightmost terms (or column k = 2^n) are A002110.
Rows are partial unions of rows of A019565.
Row n is A027750(A002110(n)), i.e., divisors of primorials.
Row sums are A054640.
Column k = 2^n-1 is A070826.
Multiplying row n by prime(n+1) gives A339195, row sums A339360.
A005117 lists squarefree numbers.
A056239 adds up prime indices, row sums of A112798.
A072047 counts prime factors of squarefree numbers.
A246867 groups squarefree numbers by Heinz weight, row sums A147655.
A329631 lists prime indices of squarefree numbers, sums A319246.
A339116 groups squarefree semiprimes by greater factor, sums A339194.

Programs

  • Maple
    b:= proc(n) option remember; `if`(n=0, [1],
          sort(map(x-> [x, x*ithprime(n)][], b(n-1))))
        end:
    T:= n-> b(n)[]:
    seq(T(n), n=1..7);  # Alois P. Heinz, Nov 28 2015
  • Mathematica
    primorial[n_] := Times @@ Prime[Range[n]]; row[n_] := Select[ Divisors[ primorial[n]], SquareFreeQ]; Table[row[n], {n, 1, 10}] // Flatten

Formula

T(n-1,k) = A339195(n,k)/prime(n). - Gus Wiseman, Aug 24 2021

A329631 Irregular triangle read by rows where row n lists the prime indices of the n-th squarefree number.

Original entry on oeis.org

1, 2, 3, 1, 2, 4, 1, 3, 5, 6, 1, 4, 2, 3, 7, 8, 2, 4, 1, 5, 9, 1, 6, 10, 1, 2, 3, 11, 2, 5, 1, 7, 3, 4, 12, 1, 8, 2, 6, 13, 1, 2, 4, 14, 1, 9, 15, 2, 7, 16, 3, 5, 2, 8, 1, 10, 17, 18, 1, 11, 3, 6, 1, 2, 5, 19, 2, 9, 1, 3, 4, 20, 21, 1, 12, 4, 5, 1, 2, 6
Offset: 1

Views

Author

Gus Wiseman, Nov 18 2019

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.

Examples

			Triangle begins:
   1: {}         33: {2,5}      66: {1,2,5}     97: {25}
   2: {1}        34: {1,7}      67: {19}       101: {26}
   3: {2}        35: {3,4}      69: {2,9}      102: {1,2,7}
   5: {3}        37: {12}       70: {1,3,4}    103: {27}
   6: {1,2}      38: {1,8}      71: {20}       105: {2,3,4}
   7: {4}        39: {2,6}      73: {21}       106: {1,16}
  10: {1,3}      41: {13}       74: {1,12}     107: {28}
  11: {5}        42: {1,2,4}    77: {4,5}      109: {29}
  13: {6}        43: {14}       78: {1,2,6}    110: {1,3,5}
  14: {1,4}      46: {1,9}      79: {22}       111: {2,12}
  15: {2,3}      47: {15}       82: {1,13}     113: {30}
  17: {7}        51: {2,7}      83: {23}       114: {1,2,8}
  19: {8}        53: {16}       85: {3,7}      115: {3,9}
  21: {2,4}      55: {3,5}      86: {1,14}     118: {1,17}
  22: {1,5}      57: {2,8}      87: {2,10}     119: {4,7}
  23: {9}        58: {1,10}     89: {24}       122: {1,18}
  26: {1,6}      59: {17}       91: {4,6}      123: {2,13}
  29: {10}       61: {18}       93: {2,11}     127: {31}
  30: {1,2,3}    62: {1,11}     94: {1,15}     129: {2,14}
  31: {11}       65: {3,6}      95: {3,8}      130: {1,3,6}
		

Crossrefs

Row sums are A319246.
Row lengths are A072047.
Same as A319247 with rows reversed.
Composition of A000720 and A265668.
Looking at all numbers instead of just squarefree numbers gives A112798.

Programs

  • Mathematica
    Table[PrimePi/@First/@If[k==1,{},FactorInteger[k]],{k,Select[Range[30],SquareFreeQ]}]

A111059 a(n) = Product_{k=1..n} A005117(k), the product of the first n squarefree positive integers.

Original entry on oeis.org

1, 2, 6, 30, 180, 1260, 12600, 138600, 1801800, 25225200, 378378000, 6432426000, 122216094000, 2566537974000, 56463835428000, 1298668214844000, 33765373585944000, 979195833992376000, 29375875019771280000
Offset: 1

Views

Author

Leroy Quet, Oct 07 2005

Keywords

Comments

Do all terms belong to A242031 (weakly decreasing prime signature)? - Gus Wiseman, May 14 2021

Examples

			Since the first 6 squarefree positive integers are 1, 2, 3, 5, 6, 7, the 6th term of the sequence is 1*2*3*5*6*7 = 1260.
From _Gus Wiseman_, May 14 2021: (Start)
The sequence of terms together with their prime signatures begins:
             1: ()
             2: (1)
             6: (1,1)
            30: (1,1,1)
           180: (2,2,1)
          1260: (2,2,1,1)
         12600: (3,2,2,1)
        138600: (3,2,2,1,1)
       1801800: (3,2,2,1,1,1)
      25225200: (4,2,2,2,1,1)
     378378000: (4,3,3,2,1,1)
    6432426000: (4,3,3,2,1,1,1)
  122216094000: (4,3,3,2,1,1,1,1)
(End)
		

Crossrefs

A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes.
A072047 applies Omega to each squarefree number.
A246867 groups squarefree numbers by Heinz weight (row sums: A147655).
A261144 groups squarefree numbers by smoothness (row sums: A054640).
A319246 gives the sum of prime indices of each squarefree number.
A329631 lists prime indices of squarefree numbers (reversed: A319247).

Programs

  • Mathematica
    Rest[FoldList[Times,1,Select[Range[40],SquareFreeQ]]] (* Harvey P. Dale, Jun 14 2011 *)
  • PARI
    m=30;k=1;for(n=1,m,if(issquarefree(n),print1(k=k*n,",")))

Extensions

More terms from Klaus Brockhaus, Oct 08 2005

A344086 Flattened tetrangle of strict integer partitions sorted first by sum, then lexicographically.

Original entry on oeis.org

1, 2, 2, 1, 3, 3, 1, 4, 3, 2, 4, 1, 5, 3, 2, 1, 4, 2, 5, 1, 6, 4, 2, 1, 4, 3, 5, 2, 6, 1, 7, 4, 3, 1, 5, 2, 1, 5, 3, 6, 2, 7, 1, 8, 4, 3, 2, 5, 3, 1, 5, 4, 6, 2, 1, 6, 3, 7, 2, 8, 1, 9, 4, 3, 2, 1, 5, 3, 2, 5, 4, 1, 6, 3, 1, 6, 4, 7, 2, 1, 7, 3, 8, 2, 9, 1, 10
Offset: 0

Views

Author

Gus Wiseman, May 11 2021

Keywords

Comments

The zeroth row contains only the empty partition.
A tetrangle is a sequence of finite triangles.

Examples

			Tetrangle begins:
  0: ()
  1: (1)
  2: (2)
  3: (21)(3)
  4: (31)(4)
  5: (32)(41)(5)
  6: (321)(42)(51)(6)
  7: (421)(43)(52)(61)(7)
  8: (431)(521)(53)(62)(71)(8)
  9: (432)(531)(54)(621)(63)(72)(81)(9)
		

Crossrefs

Positions of first appearances are A015724.
Triangle sums are A066189.
Taking revlex instead of lex gives A118457.
The not necessarily strict version is A193073.
The version for reversed partitions is A246688.
The Heinz numbers of these partitions grouped by sum are A246867.
The ordered generalization is A339351.
Taking colex instead of lex gives A344087.
A026793 gives reversed strict partitions in A-S order (sum/length/lex).
A319247 sorts reversed strict partitions by Heinz number.
A329631 sorts strict partitions by Heinz number.
A344090 gives strict partitions in A-S order (sum/length/lex).

Programs

  • Mathematica
    lexsort[f_,c_]:=OrderedQ[PadRight[{f,c}]];
    Table[Sort[Select[IntegerPartitions[n],UnsameQ@@#&],lexsort],{n,0,8}]

A339360 Sum of all squarefree numbers with greatest prime factor prime(n).

Original entry on oeis.org

1, 2, 9, 60, 504, 6336, 89856, 1645056, 33094656, 801239040, 24246190080, 777550233600, 29697402470400, 1250501433753600, 55083063155097600, 2649111037319577600, 143390180403000115200, 8619643674791667302400, 534710099148093259776000, 36412881178052121329664000
Offset: 0

Views

Author

Gus Wiseman, Dec 04 2020

Keywords

Examples

			The initial terms are:
   1 = 1,
   2 = 2,
   9 = 3 + 6,
  60 = 5 + 10 + 15 + 30.
		

Crossrefs

A010036 takes prime indices here to binary indices, row sums of A209862.
A048672 takes prime indices to binary indices in squarefree numbers.
A054640 divides the n-th term by prime(n), row sums of A261144.
A072047 counts prime factors of squarefree numbers.
A339194 is the restriction to semiprimes, row sums of A339116.
A339195 has this as row sums.
A002110 lists primorials.
A005117 lists squarefree numbers.
A006881 lists squarefree semiprimes.
A056239 is the sum of prime indices of n (Heinz weight).
A246867 groups squarefree numbers by weight, with row sums A147655.
A319246 is the sum of prime indices of the n-th squarefree number.
A319247 lists reversed prime indices of squarefree numbers.
A329631 lists prime indices of squarefree numbers.
A338899/A270650/A270652 give the prime indices of squarefree semiprimes.

Programs

  • Maple
    f:= proc(n) local i;
      `if`(n=0, 1, ithprime(n)) *mul(1+ithprime(i),i=1..n-1)
    end proc:
    map(f, [$0..20]); # Robert Israel, Dec 08 2020
  • Mathematica
    Table[Sum[Times@@Prime/@stn,{stn,Select[Subsets[Range[n]],MemberQ[#,n]&]}],{n,10}]

Formula

For n >= 1, a(n) = A054640(n-1) * prime(n).

Extensions

a(0)=1 prepended by Alois P. Heinz, Jan 08 2025

A344089 Flattened tetrangle of reversed strict integer partitions, sorted first by length and then colexicographically.

Original entry on oeis.org

1, 2, 3, 1, 2, 4, 1, 3, 5, 2, 3, 1, 4, 6, 2, 4, 1, 5, 1, 2, 3, 7, 3, 4, 2, 5, 1, 6, 1, 2, 4, 8, 3, 5, 2, 6, 1, 7, 1, 3, 4, 1, 2, 5, 9, 4, 5, 3, 6, 2, 7, 1, 8, 2, 3, 4, 1, 3, 5, 1, 2, 6, 10, 4, 6, 3, 7, 2, 8, 1, 9, 2, 3, 5, 1, 4, 5, 1, 3, 6, 1, 2, 7, 1, 2, 3, 4
Offset: 0

Views

Author

Gus Wiseman, May 12 2021

Keywords

Comments

First differs from the revlex (instead of colex) version for partitions of 12.
The zeroth row contains only the empty partition.
A tetrangle is a sequence of finite triangles.

Examples

			Tetrangle begins:
  0: ()
  1: (1)
  2: (2)
  3: (3)(12)
  4: (4)(13)
  5: (5)(23)(14)
  6: (6)(24)(15)(123)
  7: (7)(34)(25)(16)(124)
  8: (8)(35)(26)(17)(134)(125)
  9: (9)(45)(36)(27)(18)(234)(135)(126)
		

Crossrefs

Positions of first appearances are A015724 plus one.
Taking lex instead of colex gives A026793 (non-reversed: A118457).
Triangle sums are A066189.
Reversing all partitions gives A344090.
The non-strict version is A344091.
A319247 sorts strict partitions by Heinz number.
A329631 sorts reversed strict partitions by Heinz number.

Programs

  • Mathematica
    Table[Reverse/@Sort[Select[IntegerPartitions[n],UnsameQ@@#&]],{n,0,30}]

A344085 Triangle of squarefree numbers first grouped by greatest prime factor, then sorted by omega, then in increasing order, read by rows.

Original entry on oeis.org

1, 2, 3, 6, 5, 10, 15, 30, 7, 14, 21, 35, 42, 70, 105, 210, 11, 22, 33, 55, 77, 66, 110, 154, 165, 231, 385, 330, 462, 770, 1155, 2310, 13, 26, 39, 65, 91, 143, 78, 130, 182, 195, 273, 286, 429, 455, 715, 1001, 390, 546, 858, 910, 1365, 1430, 2002, 2145, 3003, 5005, 2730, 4290, 6006, 10010, 15015, 30030
Offset: 1

Views

Author

Gus Wiseman, May 11 2021

Keywords

Comments

Differs from A339195 in having 77 before 66.

Examples

			Triangle begins:
   1
   2
   3   6
   5  10  15  30
   7  14  21  35  42  70 105 210
		

Crossrefs

Programs

  • Mathematica
    nn=4;
    GatherBy[SortBy[Select[Range[Times@@Prime/@Range[nn]],SquareFreeQ[#]&&PrimePi[FactorInteger[#][[-1,1]]]<=nn&],PrimeOmega],FactorInteger[#][[-1,1]]&]

A319246 Sum of prime indices of the n-th squarefree number.

Original entry on oeis.org

0, 1, 2, 3, 3, 4, 4, 5, 6, 5, 5, 7, 8, 6, 6, 9, 7, 10, 6, 11, 7, 8, 7, 12, 9, 8, 13, 7, 14, 10, 15, 9, 16, 8, 10, 11, 17, 18, 12, 9, 8, 19, 11, 8, 20, 21, 13, 9, 9, 22, 14, 23, 10, 15, 12, 24, 10, 13, 16, 11, 25, 26, 10, 27, 9, 17, 28, 29, 9, 14, 30, 11, 12
Offset: 1

Views

Author

Gus Wiseman, Sep 15 2018

Keywords

Comments

A prime index of n is a number m such that prime(m) divides n.

Examples

			The 19th squarefree number is 30 with prime indices (3,2,1), so a(19) = 6.
		

Crossrefs

Programs

  • Mathematica
    Table[Total[Cases[FactorInteger[n],{p_,k_}:>k*PrimePi[p]]],{n,Select[Range[100],SquareFreeQ]}]

A344087 Flattened tetrangle of strict integer partitions sorted first by sum, then colexicographically.

Original entry on oeis.org

1, 2, 2, 1, 3, 3, 1, 4, 4, 1, 3, 2, 5, 3, 2, 1, 5, 1, 4, 2, 6, 4, 2, 1, 6, 1, 5, 2, 4, 3, 7, 5, 2, 1, 4, 3, 1, 7, 1, 6, 2, 5, 3, 8, 6, 2, 1, 5, 3, 1, 8, 1, 4, 3, 2, 7, 2, 6, 3, 5, 4, 9, 4, 3, 2, 1, 7, 2, 1, 6, 3, 1, 5, 4, 1, 9, 1, 5, 3, 2, 8, 2, 7, 3, 6, 4, 10
Offset: 0

Views

Author

Gus Wiseman, May 11 2021

Keywords

Comments

The zeroth row contains only the empty partition.
A tetrangle is a sequence of finite triangles.

Examples

			Tetrangle begins:
  0: ()
  1: (1)
  2: (2)
  3: (21)(3)
  4: (31)(4)
  5: (41)(32)(5)
  6: (321)(51)(42)(6)
  7: (421)(61)(52)(43)(7)
  8: (521)(431)(71)(62)(53)(8)
  9: (621)(531)(81)(432)(72)(63)(54)(9)
		

Crossrefs

Positions of first appearances are A015724.
Triangle sums are A066189.
Taking revlex instead of colex gives A118457.
The not necessarily strict version is A211992.
Taking lex instead of colex gives A344086.
A026793 gives reversed strict partitions in A-S order (sum/length/lex).
A319247 sorts strict partitions by Heinz number.
A329631 sorts reversed strict partitions by Heinz number.
A344090 gives strict partitions in A-S order (sum/length/lex).

Programs

  • Mathematica
    colex[f_,c_]:=OrderedQ[PadRight[{Reverse[f],Reverse[c]}]];
    Table[Sort[Select[IntegerPartitions[n],UnsameQ@@#&],colex],{n,0,10}]
Showing 1-10 of 12 results. Next