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

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010871 Constant sequence: a(n) = 32. 3
32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

LINKS

Table of n, a(n) for n=0..53.

Tanya Khovanova, Recursive Sequences

Index to divisibility sequences

Index entries for linear recurrences with constant coefficients, signature (1).

FORMULA

G.f.: 32/(1-x); e.g.f.: 32*e^x. - Vincenzo Librandi, Jan 24 2012

PROG

(PARI) a(n)=32 \\ Charles R Greathouse IV, Apr 07 2012

(Maxima) A010871:32$

makelist(A010871, n, 0, 30); /* Martin Ettl, Nov 08 2012 */

CROSSREFS

Sequence in context: A023474 A208129 A126271 * A248767 A022366 A165853

Adjacent sequences:  A010868 A010869 A010870 * A010872 A010873 A010874

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 16 03:30 EST 2018. Contains 318158 sequences. (Running on oeis4.)