Search: id:A007502
Results 1-1 of 1 results found.

%I A007502 M1170
%S A007502 1,2,4,9,17,33,61,112,202,361,639,1123,1961,3406,5888,10137,
%T A007502 17389,29733,50693,86204,146246,247577,418299,705479,1187857,
%U A007502 1997018,3352636,5621097,9412937,15744681,26307469,43912648
%N A007502 Les Marvin sequence: a(n) = F(n)+(n-1)F(n-1), F() = Fibonacci numbers.
%C A007502 Denominators of convergents of the continued fraction with the n partial 
               quotients: [1;1,1,...(n-1 1's)...,1,n], starting with [1], [1;2], 
               [1;1,3], [1;1,1,4], ... Numerators are A088209(n-1). - Paul D. Hanna 
               (pauldhanna(AT)juno.com), Sep 23 2003
%D A007502 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%D A007502 A problem mentioned on page 230 of J. Rec. Math., Vol. 10, 1977.
%H A007502 T. D. Noe, <a href="b007502.txt">Table of n, a(n) for n=1..500</a>
%F A007502 G.f.: (1-x^2+x^3)/(1-x-x^2)^2. - Paul D. Hanna (pauldhanna(AT)juno.com), 
               Sep 23 2003
%e A007502 a(7)=F(7)+6*F(6)=13+6*8=61.
%t A007502 F[0] = 0; F[1] = 1; F[n_] := F[n] = F[n - 1] + F[n - 2]; a[n_] := F[n] 
               + (n - 1)F[n - 1]; Table[a[n], {n, 1, 40}]
%Y A007502 Cf. A088209.
%Y A007502 a(n+1) = A109754(n, n+1) = A101220(n, 0, n+1).
%Y A007502 Sequence in context: A131095 A136379 A065026 this_sequence A088039 A115451 
               A077931
%Y A007502 Adjacent sequences: A007499 A007500 A007501 this_sequence A007503 A007504 
               A007505
%K A007502 nonn,easy,nice
%O A007502 1,2
%A A007502 N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)

Search completed in 0.001 seconds