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 A278263 #13 Sep 09 2017 19:22:42 %S A278263 1,2,4,6,2,4,12,8,6,2,6,12,6,2,6,24,16,12,6,2,6,8,30,4,6,12,6,2,6,36, %T A278263 32,6,2,6,30,6,2,6,12,24,12,6,2,6,48,12,12,24,24,4,12,60,6,6,30,6,2,6, %U A278263 30,6,2,6,72,64,12,6,2,6,12,30,12,48,6,2,6,16,60,6,24,6,2,6,60,6,6,36,12,6,2,6,96,12,6,24,30,12,30,72,6,2,6,30,30,48,12,6 %N A278263 Least number with the same prime signature as the n-th term of EKG-sequence: a(n) = A046523(A064413(n)). %C A278263 This sequence works as a "sentinel" for EKG-sequence by matching to any sequence that is obtained as f(A064413(n)), where f(n) is any function that depends only on the prime signature of n (see the index entry for "sequences computed from exponents in ..."). The last line in Crossrefs section lists such sequences that were present in the database as of Nov 11 2016. %C A278263 Terms and b-file computed from b-file of A064413 provided by _Zak Seidov_. %H A278263 Antti Karttunen, <a href="/A278263/b278263.txt">Table of n, a(n) for n = 1..10000</a> %H A278263 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a> %F A278263 a(n) = A046523(A064413(n)). %o A278263 (Scheme) (define (A278263 n) (A046523 (A064413 n))) %Y A278263 Cf. A046523, A064413, A278264. %Y A278263 Sequences that partition N into same or coarser equivalence classes: A064742, A065203. %K A278263 nonn %O A278263 1,2 %A A278263 _Antti Karttunen_, Nov 16 2016