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.

A344601 a(n) = n^2 - A344533(n).

Original entry on oeis.org

0, 0, 2, 2, 8, 6, 16, 12, 30, 18, 40, 36, 64, 40, 82, 58, 106, 72, 130, 92, 174, 104, 190, 140, 242, 150, 268, 186, 316, 220, 366, 242, 426, 260, 458, 322, 530, 326, 568, 392, 640, 434, 706, 470, 798, 496, 826, 566, 928, 602, 996, 670, 1080, 718, 1166, 792
Offset: 1

Views

Author

Paul Curtz, May 24 2021

Keywords

Comments

All terms are even.
This is the number of hidden trees (cf. A344533).

Crossrefs

Cf. A344533.
Showing 1-1 of 1 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.