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.

A317333 Indices m for which A058304(m) = 9.

This page as a plain text file.
%I A317333 #18 Oct 02 2024 16:48:23
%S A317333 1,6,14,25,30,38,49,57,62,70,78,89,97,102,113,121,126,134,142,153,158,
%T A317333 166,177,185,193,198,206,217,225,230,241,249,254,262,270,281,286,294,
%U A317333 305,313,318,326,334,345,353,358,369,377,385,390,398,409,414,422,433,441,449,454,462,473,481,486,497,505
%N A317333 Indices m for which A058304(m) = 9.
%H A317333 A.H.M. Smeets, <a href="/A317333/b317333.txt">Table of n, a(n) for n = 1..20000</a>
%F A317333 a(n) = 8*n + A317336(n).
%o A317333 (Python)
%o A317333 n, f, i, p, q = 1, 1, 0, 0, 1
%o A317333 while i < 1000000:
%o A317333     i, p, q = i+1, p*10, q*10
%o A317333     if i == f:
%o A317333         p, n = p+1, n+1
%o A317333         f = f*n
%o A317333 n, a, j = 0, 0, 0
%o A317333 while p%q > 0:
%o A317333     a, f, p, q = a+1, p//q, q, p%q
%o A317333     if f == 9:
%o A317333         n = n+1
%o A317333         print(n, a-1)
%Y A317333 Cf. A058304, A317331, A317332, A317335, A317336.
%K A317333 nonn
%O A317333 1,2
%A A317333 _A.H.M. Smeets_, Jul 26 2018