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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190569 Number of n-step one-sided prudent walks, avoiding single west steps and single east steps. 0

%I

%S 1,3,7,13,25,51,103,205,409,819,1639,3277,6553,13107,26215,52429,

%T 104857,209715,419431,838861,1677721,3355443,6710887,13421773,

%U 26843545,53687091,107374183,214748365,429496729,858993459,1717986919,3435973837

%N Number of n-step one-sided prudent walks, avoiding single west steps and single east steps.

%C a(n) = A007909(n+2).

%D S. Gao, H. Niederhausen, Sequences Arising From Prudent Self-Avoiding Walks (submitted to INTEGERS: The Electronic Journal of Combinatorial Number Theory).

%F G.f.: (1-x+2*x^2)/((1-2*x)*(1+x^2)).

%Y Essentially a duplicate of A007909.

%K nonn,walk

%O 1,2

%A _Shanzhen Gao_, May 12 2011

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 12:50 EST 2019. Contains 329958 sequences. (Running on oeis4.)