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!)
A023447 a(n) = n-5. 3
-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
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
Sequence in context: A360778 A370427 A022961 * A280916 A307336 A031016
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)