cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A100776 a(n) = 997*n + 1009.

Original entry on oeis.org

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, 35904, 36901, 37898, 38895
Offset: 0

Views

Author

Parthasarathy Nambi, Jan 03 2005

Keywords

Comments

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

Examples

			If n=1, 997*1 + 1009 = 2006.
If n=2, 997*2 + 1009 = 3003.
		

Crossrefs

Programs

Formula

From Elmo R. Oliveira, Dec 07 2024: (Start)
G.f.: (1009 - 12*x)/(1 - x)^2.
E.g.f.: (1009 + 997*x)*exp(x).
a(n) = 2*a(n-1) - a(n-2) for n > 1. (End)

Extensions

More terms from C. Ronaldo (aga_new_ac(AT)hotmail.com), Jan 19 2005
Edited by Ray Chandler, Jan 25 2005