|
| |
|
|
A060147
|
|
Nim-binomial transform of the Nim-squares sequence {0,1,3,2,6,7,5,4,13,12,14,...}.
|
|
1
| |
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
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 (davidwwilson(AT)comcast.net) Jun 12, 2005.
|
|
|
FORMULA
| a(n)=n X n, where Nim-multiplication is used, if n=2^k, else a(n)=0.
|
|
|
CROSSREFS
| See A048298.
Sequence in context: A175677 A129502 A099892 * A092731 A201567 A161829
Adjacent sequences: A060144 A060145 A060146 * A060148 A060149 A060150
|
|
|
KEYWORD
| nonn,mult
|
|
|
AUTHOR
| John W. Layman (layman(AT)math.vt.edu), Mar 06 2001
|
| |
|
|
