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-2 of 2 results.

A239622 Conjecturally, the irregular triangle of numbers k such that prime(n)^2 is the largest squared prime divisor of binomial(2k,k).

Original entry on oeis.org

0, 1, 2, 4, 3, 6, 7, 9, 10, 11, 12, 21, 22, 28, 29, 30, 31, 36, 37, 54, 55, 57, 58, 110, 171, 784, 786, 5, 8, 15, 16, 17, 20, 35, 42, 45, 50, 51, 52, 53, 56, 59, 60, 77, 80, 133, 134, 135, 136, 156, 157, 158, 159, 160, 161, 170, 210, 211, 212, 400, 401, 402, 651, 652, 785
Offset: 0

Views

Author

T. D. Noe, Mar 27 2014

Keywords

Comments

Row 0 lists the numbers k such that binomial(2k,k) is squarefree. Sequence A110494 lists the first term of each row; A239623 lists the conjectured last term; A239624 lists the conjectured length of each row.

Examples

			The irregular triangle begins:
0, 1, 2, 4
3, 6, 7, 9,..., 784, 786
5, 8, 15, 16,..., 652, 785
13, 14, 18, 19,..., 445, 2080
25, 26, 27, 32,..., 783, 902
61, 62, 63, 64,..., 2033, 2034
		

Crossrefs

Cf. A059097 (union of first two rows), A110493, A110494, A239623, A239624.

Programs

  • Mathematica
    b = 1; t = Table[b = b*(4 - 2/n); last = 0; Do[If[Mod[b, p^2] == 0, last = p], {p, Prime[Range[PrimePi[Sqrt[2*n]]]]}]; last, {n, 20000}]; t = Join[{0}, t]; Table[Flatten[Position[t, p]] - 1, {p, Join[{0}, Prime[Range[20]]]}]

A239623 Conjecturally, the largest k such that prime(n)^2 is the largest squared prime divisor of binomial(2k,k).

Original entry on oeis.org

4, 786, 785, 2080, 902, 2034, 2079, 1086, 2081, 2090, 1652, 2562, 3905, 8185, 4987, 3507, 5562, 2713, 3584, 4191, 8285, 9319, 12237, 12117, 12248, 9311, 8180, 8399, 9308, 20123, 11977, 11683, 12261, 14365, 15403, 20114, 16867, 19938, 19559, 20316, 24706
Offset: 0

Views

Author

T. D. Noe, Mar 27 2014

Keywords

Comments

The last number in row n of A239622. The 0th term is the largest number k such that binomial(2k,k) is squarefree. The first 41 terms were checked by computing binomial(2k,k) for k <= 10^5. See the plot in A110493.

Crossrefs

Programs

  • Mathematica
    b = 1; t = Table[b = b*(4 - 2/n); last = 0; Do[If[Mod[b, p^2] == 0, last = p], {p, Prime[Range[PrimePi[Sqrt[2*n]]]]}]; last, {n, 25000}]; t = Join[{0}, t]; Table[Flatten[Position[t, p]][[-1]] - 1, {p, Join[{0}, Prime[Range[20]]]}]
Showing 1-2 of 2 results.