login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023447 a(n) = n-5. 2

%I

%S -5,-4,-3,-2,-1,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,

%T 21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,

%U 44,45,46,47,48,49,50,51,52,53

%N a(n) = n-5.

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

%H Robert G. Wilson v, <a href="/A001477/a001477.txt">American English names for the numbers from 0 to 100999 without spaces or hyphens</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(n) = -A022961(n). G.f.: (-5+6*x)/(1-x)^2. - _M. F. Hasler_, Apr 18 2015

%t Range[0,60]-5 (* _Harvey P. Dale_, Feb 01 2016 *)

%o (PARI) a(n)=n-5

%Y Cf. A256958, A001057, A000027, A001477, A023443, ..., A023446, A023448, ..., A023482, A022958, ..., A022996.

%K sign,easy

%O 0,1

%A _N. J. A. Sloane_.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 01:05 EST 2020. Contains 330995 sequences. (Running on oeis4.)