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 A346529 #26 Aug 17 2021 19:36:51
%S A346529 1,1,2,2,2,1,1,1,2,0,2,2,1,1,1,1,0,1,1,2,1,1,1,0,0,1,0,2,0,2,1,0,0,1,
%T A346529 1,0,1,0,1,1,0,0,0,1,1,0,0,0,1,0,0,1,0,1,1,0,1,0,0,1,0,0,1,0,1,1,1,1,
%U A346529 0,1,0,0,0,1,0,0,0,1,1,0,1,0,0,2,0,0,0
%N A346529 a(n) is the number of primes that are nearest neighbors of the n-th Ramanujan's highly composite number A002182.
%C A346529 Terms are only 0, 1 or 2.
%F A346529 a(n) = A010051(A002182(n)-1) + A010051(A002182(n)+1). - _Michel Marcus_, Aug 17 2021
%e A346529 For n = 8 the 8th highly composite numbers is 48, thus its nearest neighbors are 47 and 49, only 47 is prime so a(8) = 1.
%e A346529 For n = 9 the 9th highly composite numbers is 60, thus its nearest neighbors are 59 and 61, both are twin primes so a(9) = 2.
%e A346529 For n = 10 the 10th highly composite numbers is 120, thus its nearest neighbors are 119 and 121, both are nonprimes so a(10) = 0.
%t A346529 f[n_] := Count[n + {-1, 1}, _?PrimeQ]; s = {}; dm = 0; Do[d = DivisorSigma[0, n]; If[d > dm, dm = d; AppendTo[s, f[n]]], {n, 1, 10^6}]; s (* _Amiram Eldar_, Aug 17 2021 *)
%Y A346529 Cf. A001097, A002182, A010051, A018252, A068507, A340580.
%K A346529 nonn
%O A346529 1,3
%A A346529 _Omar E. Pol_, Aug 17 2021
%E A346529 More terms from _Amiram Eldar_, Aug 17 2021