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

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A141835 a(n) = Sum of terms in A062901 which are below 10^n. 1
0, 7, 154, 10787, 1029567, 105714126, 10363989636, 1027216680497, 102184086890270, 10205609904879424, 1020424310227628614, 102049428685193293045, 10204479595989795520404, 1020425244837350504933851, 102041179796115463104759635, 10204085511291024760949778376 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

a(n) rapidly approaches 10^(2n)/98.

Calculating these terms appears in several places on the Internet as a sample interview problem.

LINKS

J. Wellons, Table of n, a(n) for n = 0..300

J. Wellons, An Algorithm to Compute these Terms very Efficiently

EXAMPLE

The elements of A062901 less than 1000 are 0, 7, 70, 77, 161, 168, 252, 259, 343, 434, 525, 595, 616, 686, 700, 707, 770, 777, 861, 868, 952 and 959. Their sum is a(3) = 10787.

CROSSREFS

Cf. A062901

Sequence in context: A144683 A229711 A214382 * A111831 A139226 A220367

Adjacent sequences:  A141832 A141833 A141834 * A141836 A141837 A141838

KEYWORD

nonn

AUTHOR

Jonathan Wellons (wellons(AT)gmail.com), Jul 09 2008

STATUS

approved

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

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

Last modified April 17 14:46 EDT 2014. Contains 240646 sequences.