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.

A278244 Least number with the prime signature of the n-th centered square number (A001844(n)).

This page as a plain text file.
%I A278244 #6 Nov 22 2016 21:49:23
%S A278244 1,2,2,4,2,2,6,2,6,2,6,6,2,6,2,6,6,2,6,2,4,12,2,30,2,2,6,6,24,2,2,6,2,
%T A278244 6,2,2,30,6,6,2,6,30,2,6,6,6,12,2,6,12,2,6,6,12,6,6,6,6,12,6,2,30,6,6,
%U A278244 6,2,30,6,6,2,2,12,2,6,6,6,6,6,60,2,6,6,2,6,2,2,30,2,30,6,2,30,6,30,6,30,24,2,6,2,2,30,2,12,2,6,30,6,30,2,2,6,6,6,6
%N A278244 Least number with the prime signature of the n-th centered square number (A001844(n)).
%H A278244 Antti Karttunen, <a href="/A278244/b278244.txt">Table of n, a(n) for n = 0..10000</a>
%F A278244 a(n) = A046523(A001844(n)).
%o A278244 (PARI)
%o A278244 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 A278244 A001844(n) = 2*((n^2) + n) + 1;
%o A278244 A278244(n) = A046523(A001844(n));
%o A278244 for(n=0, 10000, write("b278244.txt", n, " ", A278244(n)));
%o A278244 (Scheme) (define (A278244 n) (A046523 (A001844 n)))
%Y A278244 Cf. A001844, A046523.
%Y A278244 Cf. also A278162, A278254, A278259.
%K A278244 nonn
%O A278244 0,2
%A A278244 _Antti Karttunen_, Nov 22 2016