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 A278237 #10 Nov 19 2016 08:29:45 %S A278237 1,2,2,4,2,6,2,8,4,6,2,12,2,6,6,16,4,12,2,12,6,6,2,24,2,6,8,12,6,30,2, %T A278237 64,6,6,2,36,2,6,6,24,2,30,4,12,12,6,2,48,2,30,12,12,2,24,2,24,6,6,6, %U A278237 60,2,6,12,32,2,30,2,12,6,12,6,72,6,6,6,12,2,30,2,48,16,6,2,60,2,30,30,24,6,60,6,12,6,6,2,192,6,6,12,36,2,30,2,48,6,30,6 %N A278237 a(n) = A046523(A263273(n)). %C A278237 This sequence works as a "sentinel" for A263273 by matching to any sequence that is obtained as f(A263273(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 ..."). As of Nov 11 2016 no such sequences were present in the database, although a prefix of A050361 at first seemed to match. Note that A050361 really matches with A046523. %H A278237 Antti Karttunen, <a href="/A278237/b278237.txt">Table of n, a(n) for n = 1..19683</a> %H A278237 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a> %F A278237 a(n) = A046523(A263273(n)). %o A278237 (Scheme) (define (A278237 n) (A046523 (A263273 n))) %Y A278237 Cf. A263273. %Y A278237 Differs from A046523 for the first time at n=17, where a(17)=4, while A046523(17)=2. %Y A278237 Cf. A050361. %K A278237 nonn %O A278237 1,2 %A A278237 _Antti Karttunen_, Nov 16 2016