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.

A367616 a(n) is the unique k such that n is a comma-child of k, or -1 if k does not exist.

This page as a plain text file.
%I A367616 #19 Dec 25 2023 12:21:46
%S A367616 -1,-1,-1,-1,-1,-1,-1,-1,-1,-1,10,1,-1,-1,-1,-1,-1,-1,-1,-1,-1,20,11,
%T A367616 2,-1,-1,-1,-1,-1,-1,-1,-1,30,21,12,3,-1,-1,-1,-1,-1,-1,-1,40,31,22,
%U A367616 13,4,-1,-1,-1,-1,-1,-1,50,41,32,23,14,14,5,-1,-1,-1,-1,60,51,42,33,33,24,15,6,-1,-1,-1,70,61,52,52,43,34,25,16,7
%N A367616 a(n) is the unique k such that n is a comma-child of k, or -1 if k does not exist.
%C A367616 Similar to A367614, but here we give the k such that n is a comma-child of k, whereas in A367614 n has to be a comma-successor of k. See A367338 for definitions.
%C A367616 The first difference between A367614 and the present sequence arises because 14 has one comma-successor, 59, but has two comma-children, 59 and 60. So A367614(59) = 14, A367614(60) = -1, while in the present sequence we have a(59) = a(60) = 14.
%C A367616 There are similar differences at n = 69 and 70, because both are comma-children of 33, and at many other places.
%H A367616 Michael S. Branicky, <a href="/A367616/b367616.txt">Table of n, a(n) for n = 1..10000</a>
%o A367616 (Python)
%o A367616 def a(n):
%o A367616     y = int(str(n)[0])
%o A367616     x = (n-y)%10
%o A367616     k = n - y - 10*x
%o A367616     return k if k > 0 else -1
%o A367616 print([a(n) for n in range(1, 86)]) # _Michael S. Branicky_, Dec 18 2023
%Y A367616 Cf. A121805, A367338, A367346, A367614.
%K A367616 sign,base
%O A367616 1,11
%A A367616 _N. J. A. Sloane_, Dec 18 2023