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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A078787 a(n) = 101*n + 1. 1

%I #16 Sep 08 2022 08:45:08

%S 1,102,203,304,405,506,607,708,809,910,1011,1112,1213,1314,1415,1516,

%T 1617,1718,1819,1920,2021,2122,2223,2324,2425,2526,2627,2728,2829,

%U 2930,3031,3132,3233,3334,3435,3536,3637,3738,3839,3940,4041,4142,4243,4344

%N a(n) = 101*n + 1.

%H Vincenzo Librandi, <a href="/A078787/b078787.txt">Table of n, a(n) for n = 0..5000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F a(n) = 2*a(n-1) - a(n-2); a(0)=1, a(1)=102. - _Harvey P. Dale_, Feb 02 2015

%t 101*Range[0,50]+1 (* or *) LinearRecurrence[{2,-1},{1,102},50] (* _Harvey P. Dale_, Feb 02 2015 *)

%o (Magma) [101*n + 1: n in [0..50]]; // _Vincenzo Librandi_, Jun 05 2011

%K nonn

%O 0,2

%A Vincenzo Origlio (vincenzo.origlio(AT)itc.cnr.it), Jan 10 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)