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.

A317332 Indices m for which A058304(m) = 8.

This page as a plain text file.
%I A317332 #20 Oct 02 2024 16:54:05
%S A317332 9,17,22,33,41,46,54,65,73,81,86,94,105,110,118,129,137,145,150,161,
%T A317332 169,174,182,190,201,209,214,222,233,238,246,257,265,273,278,289,297,
%U A317332 302,310,321,329,337,342,350,361,366,374,382,393,401,406,417,425,430,438,446,457,465,470,478,489,494,502
%N A317332 Indices m for which A058304(m) = 8.
%H A317332 A.H.M. Smeets, <a href="/A317332/b317332.txt">Table of n, a(n) for n = 1..20000</a>
%F A317332 a(n) = 8*n + A317335(n).
%o A317332 (Python)
%o A317332 n, f, i, p, q = 1, 1, 0, 0, 1
%o A317332 while i < 1000000:
%o A317332     i, p, q = i+1, p*10, q*10
%o A317332     if i == f:
%o A317332         p, n = p+1, n+1
%o A317332         f = f*n
%o A317332 n, a, j = 0, 0, 0
%o A317332 while p%q > 0:
%o A317332     a, f, p, q = a+1, p//q, q, p%q
%o A317332     if f == 8:
%o A317332         n = n+1
%o A317332         print(n, a-1)
%Y A317332 Cf. A058304, A317331, A317333, A317335, A317336.
%K A317332 nonn
%O A317332 1,1
%A A317332 _A.H.M. Smeets_, Jul 26 2018