login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A097659 a(n) = 1001^n. 3
1, 1001, 1002001, 1003003001, 1004006004001, 1005010010005001, 1006015020015006001, 1007021035035021007001, 1008028056070056028008001, 1009036084126126084036009001, 1010045120210252210120045010001 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

694 is the smallest exponent e such that 1001^e begins with a digit greater than 1: A000030(a(694)) = 2, A000030(a(693)) = 1. - Reinhard Zumkeller, Nov 05 2010

a(n) gives the n-th row of Pascal's triangle (A007318) as long as all the binomial coefficients have at most three digits, otherwise the binomial coefficients with more than three digits overlap. - Daniel Forgues, Aug 12 2012

REFERENCES

Rozsa Peter, Playing with Infinity, New York, Dover Publications, 1957.

LINKS

Table of n, a(n) for n=0..10.

Tanya Khovanova, Recursive Sequences

Index entries for linear recurrences with constant coefficients, signature (1001).

FORMULA

From Philippe Deléham, Nov 30 2008: (Start)

a(n) = 1001*a(n-1), n > 0; a(0)=1.

G.f.: 1/(1-1001*x). (End)

PROG

(PARI) 1001^n \\ Charles R Greathouse IV, Jan 30 2012

CROSSREFS

Cf. A097660, A001020, A096884, A007318.

Sequence in context: A267599 A140927 A261544 * A295462 A143906 A215593

Adjacent sequences:  A097656 A097657 A097658 * A097660 A097661 A097662

KEYWORD

nonn,easy

AUTHOR

Reinhard Zumkeller, Aug 18 2004

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 09:23 EDT 2022. Contains 356960 sequences. (Running on oeis4.)