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

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

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

0,1

COMMENTS

Describe the previous term! (method A - initial term is 22).

Consider (future) b(n)=10*A000027(2n)+A000027(2n+1) = 12, 34, 56, 78, 100, 122, 144, 166, 188, 210 (different of A098080= 12, 34, 56, 78, 910 ) : a(n)= first differences of b(n). [From Paul Curtz, Sep 10 2008]

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.: 22/(1-x); e.g.f.: 22*e^x. - Vincenzo Librandi, Jan 20 2012

CROSSREFS

Cf. A005150, A005151.

Sequence in context: A022978 A023464 A126845 * A040463 A022356 A094842

Adjacent sequences:  A010858 A010859 A010860 * A010862 A010863 A010864

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 18 11:04 EDT 2017. Contains 290714 sequences.