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.

A317331 Indices m for which A058304(m) = 1.

This page as a plain text file.
%I A317331 #31 Oct 02 2024 16:48:05
%S A317331 4,8,11,16,20,23,27,32,36,40,43,47,52,55,59,64,68,72,75,80,84,87,91,
%T A317331 95,100,104,107,111,116,119,123,128,132,136,139,144,148,151,155,160,
%U A317331 164,168,171,175,180,183,187,191,196,200,203,208,212,215,219,223,228,232,235,239,244,247,251
%N A317331 Indices m for which A058304(m) = 1.
%H A317331 A.H.M. Smeets, <a href="/A317331/b317331.txt">Table of n, a(n) for n = 1..20000</a>
%F A317331 a(n) = 4*n + A014577(n-1)-1. - _A.H.M. Smeets_, Jul 29 2018
%o A317331 (Python)
%o A317331 n, f, i, p, q = 1, 1, 0, 0, 1
%o A317331 while i < 100000:
%o A317331     i, p, q = i+1, p*10, q*10
%o A317331     if i == f:
%o A317331         p, n = p+1, n+1
%o A317331         f = f*n
%o A317331 n, a, j = 0, 0, 0
%o A317331 while p%q > 0:
%o A317331     a, f, p, q = a+1, p//q, q, p%q
%o A317331     if f == 1:
%o A317331         n = n+1
%o A317331         print(n, a-1)
%Y A317331 Cf. A014577, A058304, A317332, A317333, A317335, A317336.
%K A317331 nonn
%O A317331 1,1
%A A317331 _A.H.M. Smeets_, Jul 26 2018