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 A278261 #6 Nov 19 2016 08:30:46 %S A278261 1,8,2,8,24,24,2,64,24,24,192,72,24,24,4,8,24,96,24,72,96,24,72,192, %T A278261 24,3456,192,24,3456,24,2,216,192,24,1080,72,24,8640,576,192,8640, %U A278261 3456,24,1080,3456,192,1080,120,72,96,120,24,96,360,72,576,360,24,192,120,24,72,6,8,24,1080,24,5400,8640,24,72,1080,24,432000,8640,24,3456,12288,24,120 %N A278261 a(n) = A046523(A273671(n)). %C A278261 This sequence works as a "sentinel" for A273671 by matching to any sequence that is obtained as f(A273671(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 only other sequence that as of Nov 11 2016 seems to match is A106347, although more terms of the latter would be needed to better ascertain whether the connection is spurious or genuine. %H A278261 Antti Karttunen, <a href="/A278261/b278261.txt">Table of n, a(n) for n = 1..16384</a> %H A278261 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a> %F A278261 a(n) = A046523(A273671(n)). %o A278261 (Scheme) (define (A278261 n) (A046523 (A273671 n))) %Y A278261 Cf. A046523, A273671, A278243. %Y A278261 Sequences that seem to partition N into same or coarser equivalence classes: A106347 %K A278261 nonn %O A278261 1,2 %A A278261 _Antti Karttunen_, Nov 16 2016