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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099374 Squares of A041041(n-1), n>=1 (generalized Fibonacci). 2
 0, 1, 100, 10201, 1040400, 106110601, 10822240900, 1103762461201, 112572948801600, 11481337015302001, 1170983802612002500, 119428866529408953001, 12180573402197101203600 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS See the comment in A099279. This is example a=10. LINKS Index entries for linear recurrences with constant coefficients, signature (101, 101, -1). FORMULA a(n)= A041041(n-1)^2, n>=1, a(0)=0. a(n)= 101*a(n-1) + 101*a(n-2) - a(n-3), n>=3; a(0)=0, a(1)=1, a(2)=100. a(n)= 102*a(n-1) - a(n-2) - 2*(-1)^n, n>=2; a(0)=0, a(1)=1. a(n)= (T(n, 51)-(-1)^n)/52 with the Chebyshev's polynomials of the first kind: T(n, 51)=(n). G.f.: x*(1-x)/((1-102*x+x^2)*(1+x)) = x*(1-x)/(1-101*x-101*x^2+x^3). a(n)=-(1/52)*(-1)^n+(1/104)*[51+10*sqrt(26)]^n+(1/104)*[51-10*sqrt(26)]^n, with n>=0 [From Paolo P. Lava, Aug 28 2008] MATHEMATICA LinearRecurrence[{101, 101, -1}, {0, 1, 100}, 20] (* Harvey P. Dale, Nov 10 2021 *) CROSSREFS Sequence in context: A266752 A267523 A027576 * A233627 A163663 A272681 Adjacent sequences: A099371 A099372 A099373 * A099375 A099376 A099377 KEYWORD nonn,easy AUTHOR Wolfdieter Lang, Oct 18 2004 STATUS approved

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.

Last modified December 7 21:25 EST 2022. Contains 358669 sequences. (Running on oeis4.)