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
1009, 2006, 3003, 4000, 4997, 5994, 6991, 7988, 8985, 9982, 10979, 11976, 12973, 13970, 14967, 15964, 16961, 17958, 18955, 19952, 20949, 21946, 22943, 23940, 24937, 25934, 26931, 27928, 28925, 29922, 30919, 31916, 32913, 33910, 34907 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

COMMENTS

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

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..10000

Tanya Khovanova, Recursive Sequences

EXAMPLE

If n=1, 997*1 + 1009 = 2006

If n=2, 997*2 + 1009 = 3003

PROG

(MAGMA) [997 * n + 1009: n in [0..50]]; // Vincenzo Librandi, Jul 14 2011

CROSSREFS

Cf. A101086, A017029, A100775, A101442.

Sequence in context: A024974 A025400 A182695 * A126238 A176930 A180088

Adjacent sequences:  A100773 A100774 A100775 * A100777 A100778 A100779

KEYWORD

nonn,easy

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Jan 03 2005

EXTENSIONS

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

Edited by Ray Chandler (rayjchandler(AT)sbcglobal.net), Jan 25 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.