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.

A365464 a(n) = n / gcd(n, A356867(n)).

This page as a plain text file.
%I A365464 #8 Sep 15 2023 23:09:17
%S A365464 1,1,1,4,5,1,7,1,1,10,11,4,13,7,5,8,17,1,19,5,7,22,23,1,1,13,1,28,29,
%T A365464 10,31,8,11,17,5,4,37,19,13,8,41,7,43,11,5,46,47,8,49,1,17,13,53,1,5,
%U A365464 28,19,58,59,5,61,31,7,64,13,22,67,17,23,7,71,1,73,37,1,76,77,13,79,5,1,82,83,28,17,43,29,44,89,10
%N A365464 a(n) = n / gcd(n, A356867(n)).
%C A365464 Numerator of n / A356867(n).
%H A365464 Antti Karttunen, <a href="/A365464/b365464.txt">Table of n, a(n) for n = 1..19683</a>
%F A365464 a(n) = n / A365463(n).
%o A365464 (PARI)
%o A365464 up_to = 19683;
%o A365464 A356867list(up_to) = { my(v=vector(up_to),met=Map(),h=0,ak); for(i=1,#v,if(1==vecsum(digits(i,3)), v[i] = i; h = i, ak = v[i-h]; forprime(p=2,,if(3!=p && !mapisdefined(met,p*ak), v[i] = p*ak; break))); mapput(met,v[i],i)); (v); };
%o A365464 v356867 = A356867list(up_to);
%o A365464 A356867(n) = v356867[n];
%o A365464 A365464(n) = n/gcd(n, A356867(n));
%Y A365464 Cf. A356867, A365462, A365463, A365465 (denominators).
%Y A365464 Cf. also A364501.
%K A365464 nonn,frac
%O A365464 1,4
%A A365464 _Antti Karttunen_, Sep 15 2023