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.

A060147 Nim-binomial transform of the Nim-squares sequence {0,1,3,2,6,7,5,4,13,12,14,...}.

Original entry on oeis.org

0, 1, 3, 0, 6, 0, 0, 0, 13, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 52, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 103, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
Offset: 0

Views

Author

John W. Layman, Mar 06 2001

Keywords

Comments

The Nim-binomial transform of the Nim-squares consists of the Nim-squares of the terms of the Nim-binomial transform of the integers (given in A048298).
Multiplicative with a(2^e) = A006017(e), a(p^e) = 0 otherwise. - David W. Wilson, Jun 12 2005

Crossrefs

See A048298.

Formula

a(n) = n X n, where Nim-multiplication is used, if n=2^k, else a(n)=0.