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.

A147795 If n=A000695(k_n)+2*A000695(l_n), then a(n) is the number of nonnegative integers m

Original entry on oeis.org

0, 0, 1, 1, 2, 2, 3, 3, 6, 6, 7, 7, 8, 8, 9, 9, 12, 12, 13, 13, 14, 14, 15, 15, 18, 18, 19, 19, 20, 20, 21, 21, 28, 28, 29, 29, 30, 30, 31, 31, 34, 34, 35, 35, 36, 36, 37, 37, 40, 40, 41, 41, 42, 42, 43, 43, 46, 46, 47, 47, 48, 48, 49, 49
Offset: 0

Views

Author

Vladimir Shevelev, Nov 13 2008

Keywords

Comments

Let us call integers m and n collinear one to another if either A059905(m)=A059905(n) or A059906(m)=A059906(n). Then a(n) is the number of noncollinear to n nonnegative integers not exceeding n.

Crossrefs

Formula

Theorem: a(2n)=a(2n+1).

Extensions

More terms from Philippe Deléham, Oct 18 2011