|
%I M0828 #22 Dec 17 2021 11:10:45
%S 1,2,3,7,11,25,39,89,139,317,495,1129,1763,4021,6279,14321,22363,
%T 51005,79647,181657,283667,646981,1010295,2304257,3598219,8206733,
%U 12815247,29228713,45642179,104099605,162557031,370756241,578955451,1320467933
%N Number of subsequences of [ 1,...,n ] in which each even number has an odd neighbor.
%C A055099(n) = a(2*n+1) - a(2*n) = a(2*(n+1)) - a(2*n+1). - _Reinhard Zumkeller_, Oct 25 2015
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%H T. D. Noe, <a href="/A007481/b007481.txt">Table of n, a(n) for n = 0..400</a>
%H R. K. Guy and W. O. J. Moser, <a href="http://www.fq.math.ca/Scanned/34-2/guy.pdf">Numbers of subsequences without isolated odd members</a>, Fibonacci Quarterly 34:2 (1996), pp. 152-155.
%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (0, 3, 0, 2).
%F a(n) = 3*a(n-2) + 2*a(n-4).
%F G.f.: (x^3+2*x+1)/(-2*x^4-3*x^2+1). - _Harvey P. Dale_, Feb 29 2012
%e For n=2, there are the following three subsequences of [1,2] with the desired property: empty, [1], [1,2].
%e For n=3, there are the following seven subsequences of [1,2,3] with the desired property: empty, [1], [3], [1,2], [2,3], [1,3], [1,2,3].
%t LinearRecurrence[{0,3,0,2},{1,2,3,7},40] (* _Harvey P. Dale_, Feb 29 2012 *)
%o (Haskell)
%o a007481 n = a007481_list !! n
%o a007481_list = 1 : 2 : 3 : 7 : zipWith (+)
%o (map (* 3) $ drop 2 a007481_list) (map (* 2) a007481_list)
%o -- _Reinhard Zumkeller_, Oct 25 2015
%o (PARI) a(n)=([0,1,0,0; 0,0,1,0; 0,0,0,1; 2,0,3,0]^n*[1;2;3;7])[1,1] \\ _Charles R Greathouse IV_, Mar 02 2016
%Y Cf. A007455, A007482, A007484, A055099.
%K nonn,easy,nice
%O 0,2
%A _N. J. A. Sloane_
%E More terms from _James A. Sellers_, Dec 24 1999
|
