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 A278249 #9 Nov 22 2016 21:49:42
%S A278249 1,2,4,6,6,6,12,6,36,6,60,6,6,30,60,6,6,30,12,210,210,180,12,30,12,30,
%T A278249 900,60,6,6,60,30,12,210,720,30,420,30,60,6,12,30,60,6,6,60,60,30,60,
%U A278249 210,2520,210,210,30,180,210,60,120,60,210,6,30,60,30,6,30,60,30,6,30,12,30,60,30,420,210,60,30,420,60,6,30,2520,30,30,210,12,210,60,210
%N A278249 Least number with the prime signature of A000123(n), the number of partitions of 2n into powers of 2.
%H A278249 Antti Karttunen, <a href="/A278249/b278249.txt">Table of n, a(n) for n = 0..321</a>
%F A278249 a(n) = A046523(A000123(n)).
%o A278249 (PARI)
%o A278249 A000123(n) = if(n<1, n==0, A000123(n\2)+A000123(n-1)); \\ From _M. F. Hasler_, Apr 30 2009 (?)
%o A278249 A046523(n) = my(f=vecsort(factor(n)[, 2], , 4), p); prod(i=1, #f, (p=nextprime(p+1))^f[i]) \\ From _Charles R Greathouse IV_, Aug 17 2011
%o A278249 A278249(n) = A046523(A000123(n));
%o A278249 for(n=0, 321, write("b278249.txt", n, " ", A278249(n)));
%o A278249 (Scheme) (define (A278249 n) (A046523 (A000123 n)))
%Y A278249 Cf. A000123, A046523.
%Y A278249 Cf. also A278241.
%K A278249 nonn
%O A278249 0,2
%A A278249 _Antti Karttunen_, Nov 22 2016