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 A104414 #7 Oct 08 2015 10:19:40
%S A104414 0,0,1,2,3,4,5,6,1,2,6,3,7,6,9,8,1,4,2,5,6,5,8,9,2,3,10,6,7,7,16,10,4,
%T A104414 2,7,5,6,9,12,10,4,3,6,4,9,8,14,12,2,3,7,6,11,8,7,10,5,5,12,6,7,9,12,
%U A104414 11,3,4,3,6,7,5,6,11,4,2,9,4,7,9,14,8,4,3
%N A104414 Number of prime factors, with multiplicity, of the heptanacci numbers A066178.
%C A104414 Prime heptanacci numbers: a(2) = 2, a(8) = 127, a(16) = 31489, ... Semiprime heptanacci numbers: a(4) = 4 = 2^2, a(9) = 253 = 11 * 23, a(18) = 124946 = 2 * 62473, a(24) = 7805695 = 5 * 1561139.
%F A104414 a(n) = A001222(A066178(n)). a(n) = bigomega(A066178(n)).
%e A104414 a(0)=a(1)=0 because the first two nonzero heptanacci numbers are both 1, which has zero prime divisors.
%e A104414 a(2)=1 because the 3rd nonzero heptanacci number is 2, a prime, with only one prime divisor.
%e A104414 a(3)=2 because the 4th nonzero pentanacci number is 4 = 2^2 which has (with multiplicity) 2 prime divisors (which happen to be equal).
%e A104414 a(4)=3 because the 5th nonzero heptanacci number is 8 = 2^3.
%e A104414 a(12)= 7 because A066178(12) = 2000 = 2^4 * 5^3 which has seven prime factors (four of the 2, three of them 5).
%t A104414 PrimeOmega[#]&/@LinearRecurrence[{1,1,1,1,1,1,1},{1,1,2,4,8,16,32},100] (* _Harvey P. Dale_, Oct 08 2015 *)
%Y A104414 Cf. A001222, A066178, A104411, A104412, A104413.
%K A104414 easy,nonn
%O A104414 0,4
%A A104414 _Jonathan Vos Post_, Mar 06 2005
%E A104414 More terms from _Harvey P. Dale_, Oct 08 2015