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.

A277700 a(n) = A000120(A264977(n)); number of odd terms on row n of A125184.

Original entry on oeis.org

0, 1, 1, 2, 1, 1, 2, 3, 1, 2, 1, 3, 2, 1, 3, 4, 1, 3, 2, 3, 1, 2, 3, 3, 2, 3, 1, 4, 3, 1, 4, 5, 1, 4, 3, 3, 2, 3, 3, 2, 1, 1, 2, 3, 3, 2, 3, 3, 2, 3, 3, 4, 1, 3, 4, 3, 3, 4, 1, 5, 4, 1, 5, 6, 1, 5, 4, 3, 3, 4, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 1, 2, 1, 3, 2, 1, 3, 4, 3, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 4, 3, 3, 4, 3, 1, 2, 3, 3, 4, 3, 3, 4, 3, 3, 4, 5, 1, 4, 5, 3, 4
Offset: 0

Views

Author

Antti Karttunen, Oct 27 2016

Keywords

Comments

Positions of even and odd terms are given by A008585 and A001651, which means that parity-wise the terms match with the Fibonacci numbers, A000045.

Crossrefs

Programs

Formula

a(n) = A000120(A264977(n)).
a(n) = A001221(A277330(n)) = A001222(A277330(n)).
Other identities. For all n >= 0:
a(2n) = a(n).
A000035(a(n)) = A011655(n).