|
|
A265407
|
|
Spironacci-style recurrence: a(0)=0, a(1)=1, a(n) = 2*a(n) XOR a(A265409(n)).
|
|
5
|
|
|
0, 1, 2, 4, 8, 16, 32, 64, 129, 259, 519, 1036, 2074, 4150, 8296, 16600, 33208, 66424, 132832, 265696, 531424, 1062880, 2125696, 4251521, 8502785, 17005825, 34011905, 68023301, 136047622, 272093206, 544188470, 1088378998, 2176753882, 4353515996, 8707015520, 17414063992, 34828160840, 69656354600, 139312643368
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Spironacci-polynomials evaluated at X=2 over the field GF(2).
This is otherwise computed like A078510, which starts with a(0)=0 placed in the center of spiral (in square grid), followed by a(1) = 1, after which each term is a sum of two previous terms that are nearest when terms are arranged in a spiral, that is terms a(n-1) and a(A265409(n)), except here we first multiply the term a(n-1) by 2, and use carryless XOR (A003987) instead of normal addition.
|
|
LINKS
|
|
|
FORMULA
|
a(0)=0, a(1)=1; after which, a(n) = 2*a(n) XOR a(A265409(n)).
|
|
PROG
|
(Scheme, with memoization-macro definec)
;; Where A003987bi computes bitwise-XOR as in A003987.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|