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.

A190956 a(n) = 10*a(n-1) + 6*a(n-2), with a(0)=0, a(1)=1.

This page as a plain text file.
%I A190956 #20 Dec 24 2023 01:22:30
%S A190956 0,1,10,106,1120,11836,125080,1321816,13968640,147617296,1559984800,
%T A190956 16485551776,174215426560,1841067576256,19455968321920,
%U A190956 205606088676736,2172796696698880,22961603499049216,242652815170685440,2564297772701149696,27098894618035609600
%N A190956 a(n) = 10*a(n-1) + 6*a(n-2), with a(0)=0, a(1)=1.
%H A190956 G. C. Greubel, <a href="/A190956/b190956.txt">Table of n, a(n) for n = 0..970</a>
%H A190956 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (10,6).
%F A190956 G.f.: x/(1 - 10*x - 6*x^2). - _R. J. Mathar_, Jun 01 2011
%t A190956 LinearRecurrence[{10,6}, {0,1}, 50]
%o A190956 (PARI) x='x+O('x^30); concat([0], Vec(x/(1-10*x-6*x^2))) \\ _G. C. Greubel_, Jan 25 2018
%o A190956 (Magma) I:=[0,1]; [n le 2 select I[n] else 10*Self(n-1) + 6*Self(n-2): n in [1..30]]; _G. C. Greubel_, Jan 25 2018
%K A190956 nonn,easy
%O A190956 0,3
%A A190956 _Vladimir Joseph Stephan Orlovsky_, May 24 2011