|
|
A151798
|
|
a(0)=1, a(1)=2, a(n)=4 for n>=2.
|
|
6
|
|
|
1, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
The number of solutions x (mod 2^(n+1)) of x^2 = 1 (mod 2^(n+1)), namely x = 1 (n=0), x = -1, 1 (n=1) and x = -1, 1, 2^n-1, 2^n+1 (n at least 2). - Christopher J. Smyth, May 15 2014
Also, the number of n-step self-avoiding walks on the L-lattice with no non-contiguous adjacencies (see A322419 for details of L-lattice). - Sean A. Irvine, Jul 29 2020
|
|
LINKS
|
|
|
FORMULA
|
G.f.: (1+x+2*x^2)/(1-x).
E.g.f. A(x)=x*B(x) satisfies the differential equation B'(x)=1+x+x^2+B(x). - Vladimir Kruchinin, Jan 19 2011
|
|
MATHEMATICA
|
f[n_] := Fold[#2*Floor[#1/#2 + 1/2] &, n, Reverse@ Range[n - 1]]; Array[f, 55]
|
|
PROG
|
(Magma) [ n le 1 select n+1 else 4: n in [0..104] ];
(PARI) Vec((1+x+2*x^2)/(1-x) + O(x^100)) \\ Altug Alkan, Jan 19 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,walk,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|