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

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

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

0,1

COMMENTS

A146079=2,4,8,5,4,5,8,4,2; a(n)=A146079(3n)+A146079(3n+1)+A146079(3n+2). [From Paul Curtz, Feb 13 2009]

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.: 14/(1-x). - Vincenzo Librandi, Jan 19 2012

MATHEMATICA

Table[14, {70}] (* Vincenzo Librandi, Jan 19 2012 *)

CROSSREFS

Sequence in context: A199256 A199201 A128883 * A186128 A105707 A157427

Adjacent sequences:  A010850 A010851 A010852 * A010854 A010855 A010856

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 December 6 15:25 EST 2016. Contains 278781 sequences.