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.
Daniele Parisse has authored 3 sequences.
a(n) = (7+sqrt(24*n-23))\6; \\ Michel Marcus, Oct 30 2019
A035531 := proc(n) A000120(n)+A001221(n)-1 ; end proc: seq(A035531(n),n=1..100) ; # R. J. Mathar, Mar 12 2018
Table[DigitCount[n, 2, 1] + PrimeNu[n] - 1, {n, 1, 100}] (* G. C. Greubel, Apr 24 2017 *)
a(n) = hammingweight(n) + omega(n) - 1; \\ Michel Marcus, Apr 25 2017
from sympy import primefactors
def a(n): return 0 if n<2 else bin(n)[2:].count("1") + len(primefactors(n)) - 1 # Indranil Ghosh, Apr 25 2017
a035532 1 = 1
a035532 n = if a010051' n == 0 then phi2 else phi2 - a000120 n + 1
where phi2 = 2 * a000010 n
-- Reinhard Zumkeller, Feb 04 2015
Insert[Table[If[PrimeQ[n],2*EulerPhi[n] - DigitCount[n, 2][[1]] + 1, 2*EulerPhi[n]], {n, 2, 100}], 1, 1] (* Stefan Steinerberger, Apr 11 2006 *)
A035532(n)=2*eulerphi(n)-if(isprime(n),hammingweight(n)-1,n==1) \\ M. F. Hasler, Mar 10 2018