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.

A263831 Values of k such that the number of rooted trees with k nodes (A000081(k)) is odd.

Original entry on oeis.org

1, 2, 5, 8, 10, 14, 15, 16, 17, 18, 22, 23, 25, 27, 28, 30, 33, 35, 38, 40, 42, 49, 50, 56, 61, 64, 65, 67, 68, 71, 73, 74, 75, 76, 77, 78, 82, 84, 87, 93, 98, 99, 104, 108, 113, 114, 115, 117, 118, 119, 120, 121, 122, 123, 124, 127, 128, 135, 137, 138, 139
Offset: 1

Views

Author

Vladimir Reshetnikov, Nov 03 2015

Keywords

Comments

Complement of A258592.

Crossrefs

Programs

  • Mathematica
    Module[{t}, t[1] = 1; t[k_] := t[k] = Sum[DivisorSum[k-m, t[#] # &] t[m]/(k-1), {m, k-1}]; Select[Range[140], OddQ@t[#] &]] (* after Alois P. Heinz *)