|
Search: id:A068052
|
|
|
| A068052 |
|
Start from 1, shift one left and sum mod 2 (bitwise-XOR) to get 3 (11 in binary), then shift two steps left and XOR to get 15 (1111 in binary), then three steps and XOR to get 119 (1110111 in binary), then four steps and so on. Sequence A068053 converted to decimal. |
|
+0
4
|
|
| 1, 3, 15, 119, 1799, 59367, 3743271, 481693095, 123123509927, 62989418816679, 64491023022979239, 132015402419352060071, 540829047855347718631591, 4430403202865824763042320551, 72583450474242118015031400337575
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
MAPLE
|
with(gfun, seriestolist); [seq(foo(map(`mod`, seriestolist(series(mul(1+(z^i), i=1..n), z, binomial(n+1, 2)+1)), 2)), n=0..20)];
foo := proc(a) local i; add(a[i]*2^(i-1), i=1..nops(a)); end;
|
|
CROSSREFS
|
a(n) = each row of A053632 reduced mod 2 and interpreted as a binary number. Same sequence in binary: A068053.
Sequence in context: A145161 A121422 A060639 this_sequence A068859 A006454 A112228
Adjacent sequences: A068049 A068050 A068051 this_sequence A068053 A068054 A068055
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Antti Karttunen, Feb 13 2002
|
|
|
Search completed in 0.002 seconds
|
