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 A085029 #24 Mar 15 2025 14:04:35
%S A085029 1,1,2,1,2,1,2,1,3,2,3,1,2,2,2,1,2,2,2,1,3,2,3,2,4,3,3,1,5,2,2,2,3,3,
%T A085029 4,2,4,3,3,1,4,2,4,2,3,4,5,2,2,4,6,2,5,2,6,2,4,2,5,1,2,4,3,2,4,2,4,3,
%U A085029 3,2,5,2,5,4,3,3,4,5,4,2,7,4,7,2,2,4,3,3,4,3,6,1,3,3,5,1,6,3,5,4
%N A085029 Number of prime factors of cyclotomic(n,4), which is A019322(n), the value of the n-th cyclotomic polynomial evaluated at x=4.
%C A085029 The Mobius transform of this sequence yields A057957, number of prime factors of 4^n-1.
%D A085029 See references at A085021
%H A085029 Max Alekseyev, <a href="/A085029/b085029.txt">Table of n, a(n) for n = 1..1128</a>
%t A085029 Table[Plus@@Transpose[FactorInteger[Cyclotomic[n, 4]]][[2]], {n, 1, 100}]
%Y A085029 omega(Phi(n,x)): A085021 (x=2), A085028 (x=3), this sequence (x=4), A085030 (x=5), A085031 (x=6), A085032 (x=7), A085033 (x=8), A085034 (x=9), A085035 (x=10).
%Y A085029 Cf. A019322, A057957.
%K A085029 nonn
%O A085029 1,3
%A A085029 _T. D. Noe_, Jun 19 2003