login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A094825 Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 7. 3

%I #19 Feb 12 2022 17:48:02

%S 1,7,35,153,624,2444,9333,35055,130207,479941,1759616,6427032,

%T 23412105,85121783,309062619,1121050449,4063463728,14721293860,

%U 53313308477,193023319071,698715633111,2528895064637,9152032060800,33118656195888

%N Number of (s(0), s(1), ..., s(2n)) such that 0 < s(i) < 10 and |s(i) - s(i-1)| = 1 for i = 1,2,...,2n, s(0) = 1, s(2n) = 7.

%H Michael De Vlieger, <a href="/A094825/b094825.txt">Table of n, a(n) for n = 3..1792</a>

%H László Németh and László Szalay, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL24/Nemeth/nemeth8.html">Sequences Involving Square Zig-Zag Shapes</a>, J. Int. Seq., Vol. 24 (2021), Article 21.5.2.

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (8,-21,20,-5).

%F a(n) = (1/5)*Sum_{r=1..9} sin(r*Pi/10)*sin(7*r*Pi/10)*(2*cos(r*Pi/10))^(2n).

%F a(n) = 8*a(n-1) - 21*a(n-2) + 20*a(n-3) - 5*a(n-4).

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

%F a(n) = -A001906(n)/2 + A020876(n)/10. - _R. J. Mathar_, Jun 24 2011

%t LinearRecurrence[{8,-21,20,-5},{1,7,35,153},30] (* _Harvey P. Dale_, Jan 16 2015 *)

%Y Cf. A094865 (partial sums).

%K nonn

%O 3,2

%A _Herbert Kociemba_, Jun 15 2004

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)