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.
%I A337927 #42 Dec 21 2024 22:01:19 %S A337927 1,1,1,1,1,1,1,1,1,10,1,4,13,14,5,16,17,2,19,10,7,1,23,4,25,13,3,14, %T A337927 29,10,31,32,1,34,35,4,37,38,13,10,41,7,43,1,5,23,47,4,49,10,17,52,53, %U A337927 6,1,56,19,58,59,10,61,31,7,32,65,1,67,34,23,10,71,8,73,74,25,76,1,26,79 %N A337927 a(n) = n / GCD (n, reverse of n). %C A337927 a(n)=n for n in A226778. - _Robert Israel_, Oct 09 2020 %H A337927 Robert Israel, <a href="/A337927/b337927.txt">Table of n, a(n) for n = 1..10000</a> %F A337927 a(n) = n / gcd(n, A004086(n)). %F A337927 a(n) = n / A055483(n). %F A337927 a(n) = A000027(n) / A055483(n). %e A337927 a(12) = 4 since 12 / gcd(12,21) = 4. a(101) = 101 / gcd(101,101) = 1. %p A337927 rev:= proc(n) local L,k; %p A337927 L:= convert(n,base,10); %p A337927 add(L[-k]*10^(k-1),k=1..nops(L)) %p A337927 end proc: %p A337927 f:= n -> n/igcd(n,rev(n)): %p A337927 map(f, [$1..100]); # _Robert Israel_, Oct 09 2020 %t A337927 Table[n/GCD[n, IntegerReverse[n]], {n, 1, 100}] (* _Amiram Eldar_, Oct 05 2020 *) %o A337927 (PARI) a(n) = n/gcd(n, fromdigits(Vecrev(digits(n)))); \\ _Michel Marcus_, Oct 06 2020 %Y A337927 Cf. A000027, A002113, A004086, A055483, A226778. %K A337927 base,easy,nonn,look %O A337927 1,10 %A A337927 _Ctibor O. Zizka_, Oct 05 2020