login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

a(n) = n - 14.
0

%I #16 Feb 07 2023 15:43:41

%S -14,-13,-12,-11,-10,-9,-8,-7,-6,-5,-4,-3,-2,-1,0,1,2,3,4,5,6,7,8,9,

%T 10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,

%U 33,34,35,36,37,38,39,40,41,42,43,44,45,46

%N a(n) = n - 14.

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

%H Robert G. Wilson v, <a href="/A001477/a001477.txt">American English names for the numbers from 0 to 100999 without spaces or hyphens</a>.

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

%t Range[0,60]-14 (* or *) LinearRecurrence[{2,-1},{-14,-13},70] (* or *) Range[-14,50] (* _Harvey P. Dale_, Feb 07 2023 *)

%o (PARI) a(n)=n-14

%K sign,easy

%O 0,1

%A _N. J. A. Sloane_.