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.

A281787 a(n) = sum of all numbers between 1 and 10^n that are divisible by 3 or 5.

This page as a plain text file.
%I A281787 #31 May 04 2025 04:22:18
%S A281787 23,2318,233168,23331668,2333316668,233333166668,23333331666668,
%T A281787 2333333316666668,233333333166666668,23333333331666666668,
%U A281787 2333333333316666666668,233333333333166666666668,23333333333331666666666668,2333333333333316666666666668
%N A281787 a(n) = sum of all numbers between 1 and 10^n that are divisible by 3 or 5.
%H A281787 Jerry Polfer, <a href="/A281787/b281787.txt">Table of n, a(n) for n = 1..500</a>
%H A281787 Project Euler, <a href="https://projecteuler.net/problem=1">Problem 1: Multiples of 3 and 5</a>
%H A281787 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (111,-1110,1000).
%F A281787 G.f.: -x*(23-235*x+1400*x^2)/((x-1)*(100*x-1)*(10*x-1)). - _Alois P. Heinz_, Jan 30 2017
%F A281787 a(n) = (7/30)*100^n - (1/6)*10^n + 4/3. - _Robert Israel_, Jan 31 2017
%F A281787 E.g.f.: (7*exp(100*x) - 5*exp(10*x) + 40*exp(x) - 42)/30. - _Stefano Spezia_, May 03 2025
%e A281787 For n = 1, a(1) = 3 + 5 + 6 + 9 = 23.
%o A281787 (PARI) Vec(-x*(23-235*x+1400*x^2)/((x-1)*(100*x-1)*(10*x-1)) + O(x^15)) \\ _Felix Fröhlich_, Jan 30 2017
%Y A281787 Cf. A281746.
%K A281787 nonn,easy
%O A281787 1,1
%A A281787 _Jerry Polfer_, Jan 29 2017