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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A008596 Multiples of 14. 14

%I

%S 0,14,28,42,56,70,84,98,112,126,140,154,168,182,196,210,224,238,252,

%T 266,280,294,308,322,336,350,364,378,392,406,420,434,448,462,476,490,

%U 504,518,532,546,560,574,588,602,616,630,644,658,672,686,700,714,728

%N Multiples of 14.

%C a(n) = A033571(n) - A158186(n). - _Reinhard Zumkeller_, Mar 13 2009

%H Vincenzo Librandi, <a href="/A008596/b008596.txt">Table of n, a(n) for n = 0..1000</a>

%H Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>

%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=326">Encyclopedia of Combinatorial Structures 326</a>

%H <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).

%F a(n) = 14n = 2*a(n-1) - a(n-2). G.f.: 14x/(x-1)^2. - _R. J. Mathar_, Jun 23 2009

%t Range[0, 1000, 14] (* _Vladimir Joseph Stephan Orlovsky_, May 31 2011 *)

%t CoefficientList[Series[14 x / (x - 1)^2, {x, 0, 60}], x] (* _Vincenzo Librandi_, Jun 10 2013 *)

%o (PARI) a(n)=14*n \\ _Charles R Greathouse IV_, Sep 28 2015

%Y Cf. A008594, A008595.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_

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 October 14 14:45 EDT 2019. Contains 328019 sequences. (Running on oeis4.)