|
%I #22 Aug 20 2024 12:50:29
%S 1,2,3,4,5,6,7,8,9,10,10,1,13,14,15,16,17,18,19,20,21,20,10,2,25,26,
%T 27,28,29,30,31,32,30,21,1,3,37,38,39,40,41,42,43,40,31,20,13,4,49,50,
%U 51,52,53,54,50,41,32,10,14,14,5,62,63,64,65,14,51,42,30,30,2,15,6,74,75
%N a(n) is the most remote positive ancestor of n in the comma-child graph.
%C Like A367366 but allows ancestors that are not comma-predecessors. More specifically, A367366(n) is the most remote positive ancestor of n in the comma-successor graph. See A367338 for definitions.
%C This sequence first differs from A367366 at n = 60.
%H Michael S. Branicky, <a href="/A367617/b367617.txt">Table of n, a(n) for n = 1..10000</a>
%H Eric Angelini, Michael S. Branicky, Giovanni Resta, N. J. A. Sloane, and David W. Wilson, The Comma Sequence: A Simple Sequence With Bizarre Properties, <a href="http://arxiv.org/abs/2401.14346">arXiv:2401.14346</a>, <a href="https://www.youtube.com/watch?v=_EHAdf6izPI">Youtube</a>
%e a(60) = a(66) = 14, since 66 is a comma-child of 60, and 60 is a comma-child of 14, and 14 is not the comma-child of any positive number. In other words, A367616(A367616(66)) = A367616(60) = 14, and A367616(14) = -1.
%o (Python)
%o def comma_parent(n): # A367616(n)
%o y = int(str(n)[0])
%o x = (n-y)%10
%o k = n - y - 10*x
%o return k if k > 0 else -1
%o def a(n):
%o an = n
%o while (cp:=comma_parent(an)) > 0: an = cp
%o return an
%o print([a(n) for n in range(1, 76)]) # _Michael S. Branicky_, Dec 18 2023
%Y Cf. A367338, A367366, A367616.
%K nonn,base
%O 1,2
%A _Michael S. Branicky_ and _N. J. A. Sloane_, Dec 18 2023
|
