|
Search: id:A107663
|
|
| |
|
| 1, 9, 7, 25, 31, 81, 127, 289, 511, 1089, 2047, 4225, 8191, 16641, 32767, 66049, 131071, 263169, 524287, 1050625, 2097151, 4198401, 8388607, 16785409, 33554431, 67125249, 134217727, 268468225, 536870911, 1073807361, 2147483647
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(2n) = A085903(2n) = A083420(n)
|
|
REFERENCES
|
I. Strazdins, Universal affine classification of Boolean functions, Acta Applic. Math. 46 (1997), 147-167.
|
|
LINKS
|
Illustration of initial terms from H. Bottomley (A028400)
|
|
FORMULA
|
G.f. (-1-8*x+6*x^2+16*x^3)/((1-2*x)*(x+1)*(2*x^2-1))
|
|
PROGRAM
|
Floretion Algebra Multiplication Program, FAMP Code: tesseq[A*B] with A = + .25'i + .25'j + .25'k + .25i' + .25j' + .25k' + .25'ii' + .25'jj' + .25'kk' + .25'ij' + .25'ik' + .25'ji' + .25'jk' + .25'ki' + .25'kj' + .25e and B = + .5'i + .5i' + 'ii' + e
|
|
CROSSREFS
|
Cf. A083420, A028400, A062510, A085903.
Sequence in context: A011405 A131724 A124050 this_sequence A038297 A144622 A069242
Adjacent sequences: A107660 A107661 A107662 this_sequence A107664 A107665 A107666
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Creighton Dement (creighton.k.dement(AT)uni-oldenburg.de), May 19 2005
|
|
|
Search completed in 0.002 seconds
|
