This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A023447 a(n) = n-5. 2
 -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, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Tanya Khovanova, Recursive Sequences Robert G. Wilson v, American English names for the numbers from 0 to 100999 without spaces or hyphens. Index entries for linear recurrences with constant coefficients, signature (2,-1). FORMULA 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 MATHEMATICA Range[0, 60]-5 (* Harvey P. Dale, Feb 01 2016 *) PROG (PARI) a(n)=n-5 CROSSREFS Cf. A256958, A001057, A000027, A001477, A023443, ..., A023446, A023448, ..., A023482, A022958, ..., A022996. Sequence in context: A073743 A021652 A022961 * A280916 A307336 A031016 Adjacent sequences:  A023444 A023445 A023446 * A023448 A023449 A023450 KEYWORD sign,easy AUTHOR STATUS approved

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.

Last modified December 9 09:21 EST 2019. Contains 329877 sequences. (Running on oeis4.)