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 A360616 #6 Mar 08 2023 23:17:19
%S A360616 0,0,0,1,0,1,0,1,1,1,0,1,0,1,1,2,0,1,0,1,1,1,0,2,1,1,1,1,0,1,0,2,1,1,
%T A360616 1,2,0,1,1,2,0,1,0,1,1,1,0,2,1,1,1,1,0,2,1,2,1,1,0,2,0,1,1,3,1,1,0,1,
%U A360616 1,1,0,2,0,1,1,1,1,1,0,2,2,1,0,2,1,1,1
%N A360616 Half the number of prime factors of n (counted with multiplicity, A001222), rounded down.
%e A360616 The prime indices of 378 are {1,2,2,2,4}, so a(378) = floor(5/2) = 2.
%t A360616 Table[Floor[PrimeOmega[n]/2],{n,100}]
%Y A360616 Positions of 0's are 1 and A000040.
%Y A360616 Positions of first appearances are A000302 = 2^(2k) for k >= 0.
%Y A360616 Positions of 1's are A168645.
%Y A360616 Rounding up instead of down gives A360617.
%Y A360616 A112798 lists prime indices, length A001222, sum A056239, median* A360005.
%Y A360616 A360673 counts multisets by right sum (exclusive), inclusive A360671.
%Y A360616 First for prime indices, second for partitions, third for prime factors:
%Y A360616 - A360676 gives left sum (exclusive), counted by A360672, product A361200.
%Y A360616 - A360677 gives right sum (exclusive), counted by A360675, product A361201.
%Y A360616 - A360678 gives left sum (inclusive), counted by A360675, product A347043.
%Y A360616 - A360679 gives right sum (inclusive), counted by A360672, product A347044.
%Y A360616 Cf. A001248, A026424, A280076, A359912, A360006, A360457, A360674.
%K A360616 nonn
%O A360616 1,16
%A A360616 _Gus Wiseman_, Mar 08 2023