cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A166915 a(n) = 20*a(n-1) - 64*a(n-2) - 45 for n>1; a(0) = 399, a(1) = 5695.

This page as a plain text file.
%I A166915 #11 Oct 21 2022 22:10:12
%S A166915 399,5695,88319,1401855,22384639,357974015,5726863359,91626930175,
%T A166915 1466019348479,23456263438335,375300030463999,6004799749226495,
%U A166915 96076793034833919,1537228676746182655,24595658780694282239
%N A166915 a(n) = 20*a(n-1) - 64*a(n-2) - 45 for n>1; a(0) = 399, a(1) = 5695.
%C A166915 Related to Reverse and Add trajectory of 318 in base 4: A075153(6*n+3) = 15*a(n).
%C A166915 lim_{n -> infinity} a(n)/a(n-1) = 16.
%H A166915 G. C. Greubel, <a href="/A166915/b166915.txt">Table of n, a(n) for n = 0..500</a>
%H A166915 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (21, -84, 64).
%F A166915 a(n) = (1024*16^n + 176*4^n - 3)/3.
%F A166915 G.f.: (399 - 2684*x + 2240*x^2)/((1-x)*(1-4*x)*(1-16*x)).
%F A166915 From _G. C. Greubel_, May 28 2016: (Start)
%F A166915 a(n) = 21*a(n-1) - 84*a(n-2) + 64*a(n-3).
%F A166915 E.g.f.: (1/3)*(1024*exp(16*x) + 176*exp(4*x) - 3*exp(x)). (End)
%t A166915 LinearRecurrence[{21, -84, 64}, {399, 5695, 88319}, 50] (* _G. C. Greubel_, May 28 2016 *)
%o A166915 (PARI) m=15; v=concat([399, 5695], vector(m-2)); for(n=3, m, v[n]=20*v[n-1]-64*v[n-2]-45); v
%Y A166915 Cf. A075153, A166912, A166913, A166914, A166916, A166917, A006105, A167031, A167032, A167033.
%K A166915 nonn,easy
%O A166915 0,1
%A A166915 _Klaus Brockhaus_, Oct 27 2009