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.
%I A046915 #28 Sep 08 2022 08:44:56
%S A046915 1,18,217,2340,24211,246078,2480437,24902280,249511591,2497558338,
%T A046915 24987792457,249938963820,2499694822171,24998474116998,
%U A046915 249992370597277,2499961853010960,24999809265103951,249999046325618058,2499995231628286897
%N A046915 Sum of divisors of 10^n.
%C A046915 A072692(n) = A049000(n) + a(n).
%C A046915 a(n) is the number of full-dimensional lattices in Z^(n+1) with volume 10. - _Álvar Ibeas_, Nov 29 2015
%H A046915 Vincenzo Librandi, <a href="/A046915/b046915.txt">Table of n, a(n) for n = 0..1000</a>
%H A046915 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (18,-97,180,-100).
%F A046915 a(n) = 1/4*(2^(n+1)-1)*(5^(n+1)-1). E.g., a(1) = 1/4*(2^2-1)*(5^2-1) = 18. - _Vladeta Jovovic_, Dec 18 2001
%F A046915 a(n) = 18*a(n-1)-97*a(n-2)+180*a(n-3)-100*a(n-4). - _Colin Barker_, Jan 27 2015
%F A046915 G.f.: -(10*x^2-1) / ((x-1)*(2*x-1)*(5*x-1)*(10*x-1)). - _Colin Barker_, Jan 27 2015
%e A046915 At 10^1 the factors are 1, 2, 5, 10. The sum of these factors is 18: 1 + 2 + 5 + 10.
%t A046915 Table[DivisorSigma[1, 10^n], {n, 0, 18}] (* _Jayanta Basu_, Jun 30 2013 *)
%o A046915 (Magma) [1/4*(2^(n+1)-1)*(5^(n+1)-1): n in [0..20]]; // _Vincenzo Librandi_, Oct 03 2011
%o A046915 (PARI) Vec(-(10*x^2-1)/((x-1)*(2*x-1)*(5*x-1)*(10*x-1)) + O(x^100)) \\ _Colin Barker_, Jan 27 2015
%o A046915 (PARI) a(n) = sigma(10^n); \\ _Altug Alkan_, Dec 04 2015
%Y A046915 Cf. A000203 (sigma(n)), A049000, A072692. 10th row of A160870, shifted.
%K A046915 easy,nonn
%O A046915 0,2
%A A046915 _Enoch Haga_