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.

A317336 a(n) = A317333(n) - 8*n.

This page as a plain text file.
%I A317336 #21 Mar 21 2023 15:35:32
%S A317336 -7,-10,-10,-7,-10,-10,-7,-7,-10,-10,-10,-7,-7,-10,-7,-7,-10,-10,-10,
%T A317336 -7,-10,-10,-7,-7,-7,-10,-10,-7,-7,-10,-7,-7,-10,-10,-10,-7,-10,-10,
%U A317336 -7,-7,-10,-10,-10,-7,-7,-10,-7,-7,-7,-10,-10,-7,-10,-10,-7,-7,-7,-10,-10,-7,-7,-10,-7,-7
%N A317336 a(n) = A317333(n) - 8*n.
%H A317336 A.H.M. Smeets, <a href="/A317336/b317336.txt">Table of n, a(n) for n = 1..20000</a>
%H A317336 <a href="/index/Fo#fold">Index entries for sequences obtained by enumerating foldings</a>
%F A317336 a(4*n+4) = -7, a(4*n+2) = -10, for n > 0. a(1) = -7 and a(2*n-1) = a(n) for n > 1.
%F A317336 abs(a(n+2)+8) = A014710(n) for n >= 0.
%F A317336 a(n) = -7-3*A082410(n)
%o A317336 (Python)
%o A317336 n, f, i, p, q = 1, 1, 0, 0, 1
%o A317336 while i < 1000000:
%o A317336     i, p, q = i + 1, p * 10, q * 10
%o A317336     if i == f:
%o A317336         p, n = p + 1, n + 1
%o A317336         f = f * n
%o A317336 n, a, j = 0, 0, 0
%o A317336 while p % q > 0:
%o A317336     a, f, p, q = a + 1, p // q, q, p % q
%o A317336     if f == 9:
%o A317336         n = n + 1
%o A317336         print(n, a - 1 - 8 * n)
%Y A317336 Cf. A014710, A082410, A317331, A317332, A317333, A317335.
%K A317336 sign
%O A317336 1,1
%A A317336 _A.H.M. Smeets_, Jul 26 2018