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

A111616 n divided by the third upper diagonal of the array in A111615.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1
Offset: 1

Views

Author

Keywords

Comments

a(n)=2 for n's: 6,10,18,20,22,30,34,36,38,44,50,52,56,58,62,... =A111617.

Crossrefs

Cf. A111615.

Programs

  • Mathematica
    f[n_] := f[n] = Block[{a}, a[0] = 1; a[l_] := a[l] = Block[{k = 1, s = Sum[ a[i]*x^i, {i, 0, l - 1}]}, While[ IntegerQ[ Last[ CoefficientList[ Series[(s + k*x^l)^(1/n), {x, 0, l}], x]]] != True, k++ ]; k]; Table[a[j], {j, 0, 128}]]; g[n_, m_] := f[n][[m]]; Table[ n / g[n, n + 3], {n, 105}]
Showing 1-1 of 1 results.