login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A023443 n-1. 13
-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, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

LINKS

Tanya Khovanova, Recursive Sequences

Robert G. Wilson v, American English names for the numbers from 0 to 100999 without spaces or hyphens.

FORMULA

a(n)= 2*a(n-1) -a(n-2). G.f.: (-1+2*x)/(x-1)^2. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Feb 11 2010]

PROG

(PARI) a(n)=n-1 \\ Charles R Greathouse IV, Aug 26 2011

CROSSREFS

Sequence in context: A173474 * A099570 A114142 A020725 A119972 A131738

Adjacent sequences:  A023440 A023441 A023442 * A023444 A023445 A023446

KEYWORD

sign,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 08:46 EST 2012. Contains 205614 sequences.