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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100776 a(n) = 997 * n + 1009. 4

%I

%S 1009,2006,3003,4000,4997,5994,6991,7988,8985,9982,10979,11976,12973,

%T 13970,14967,15964,16961,17958,18955,19952,20949,21946,22943,23940,

%U 24937,25934,26931,27928,28925,29922,30919,31916,32913,33910,34907

%N a(n) = 997 * n + 1009.

%C Note that 997 is the largest three-digit prime and 1009 is the smallest four-digit prime.

%H Vincenzo Librandi, <a href="/A100776/b100776.txt">Table of n, a(n) for n = 0..10000</a>

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

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

%e If n=1, 997*1 + 1009 = 2006.

%e If n=2, 997*2 + 1009 = 3003.

%p A100776:=n->997 * n + 1009; seq(A100776(n), n=0..50); # _Wesley Ivan Hurt_, Jan 22 2014

%t Table[997 n + 1009, {n, 0, 50}] (* _Wesley Ivan Hurt_, Jan 22 2014 *)

%o (MAGMA) [997 * n + 1009: n in [0..50]]; // _Vincenzo Librandi_, Jul 14 2011

%o (PARI) a(n)=997*n+1009 \\ _Charles R Greathouse IV_, Jul 10 2016

%Y Cf. A101086, A017029, A100775, A101442.

%K nonn,easy

%O 0,1

%A _Parthasarathy Nambi_, Jan 03 2005

%E More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 19 2005

%E Edited by _Ray Chandler_, Jan 25 2005

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 November 14 02:19 EST 2019. Contains 329108 sequences. (Running on oeis4.)