%I A141835
%S A141835 0,7,154,10787,1029567,105714126,10363989636,1027216680497,102184086890270,
%T A141835 10205609904879424,1020424310227628614,102049428685193293045,10204479595989795520404,
%U A141835 1020425244837350504933851,102041179796115463104759635,10204085511291024760949778376
%N A141835 a(n) = Sum of terms in A062901 which are below 10^n.
%C A141835 a(n) rapidly approaches 10^(2n)/98.
%C A141835 Calculating these terms appears in several places on the Internet as 
               a sample interview problem.
%H A141835 J. Wellons, <a href="b141835.txt">Table of n, a(n) for n = 0..300</a>
%H A141835 J. Wellons, <a href="http://wellons.wordpress.com/2008/07/08/divisible-by-7-both-ways/
               ">An Algorithm to Compute these Terms very Efficiently</a>
%e A141835 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.
%Y A141835 Cf. A062901
%Y A141835 Sequence in context: A100868 A006761 A144683 this_sequence A111831 A139226 
               A073605
%Y A141835 Adjacent sequences: A141832 A141833 A141834 this_sequence A141836 A141837 
               A141838
%K A141835 nonn
%O A141835 0,2
%A A141835 Jonathan Wellons (wellons(AT)gmail.com), Jul 09 2008