login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A107663 a(2n) = 2*4^n-1, a(2n+1) = (2^(n+1)+1)^2; interlaces A083420 with A028400. 1
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; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(2n) = A085903(2n) = A083420(n)

REFERENCES

I. Strazdins, Universal affine classification of Boolean functions, Acta Applic. Math. 46 (1997), 147-167.

LINKS

Table of n, a(n) for n=0..30.

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))

PROG

Floretion Algebra Multiplication Program, FAMP Code: 4tesseq[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: A190995 A186830 A124050 * A231605 A248307 A168159

Adjacent sequences:  A107660 A107661 A107662 * A107664 A107665 A107666

KEYWORD

easy,nonn

AUTHOR

Creighton Dement, May 19 2005

EXTENSIONS

Factor added to formula by Creighton Dement, Dec 11 2009

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 19:06 EST 2017. Contains 294894 sequences.