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 A346468 #19 Nov 23 2021 18:11:22
%S A346468 0,1,1,3,1,5,1,7,2,9,1,11,1,13,7,15,1,17,1,19,1,21,1,23,2,25,13,27,1,
%T A346468 29,1,31,2,33,17,35,1,37,19,39,1,41,1,43,1,45,1,47,1,49,5,51,1,53,3,
%U A346468 55,2,57,1,59,1,61,31,63,4,65,1,67,17,69,1,71,1,73,37,75,19,77,1,79,1,81,1,83,1,85,43,87,1,89
%N A346468 a(n) = (n-1) / A346467(n).
%C A346468 Numbers n such that a(n) = 1 are A248614(m)+1 for m > 0. These are all primes together with A317210. The set of these numbers has zero asymptotic density.
%H A346468 Antti Karttunen, <a href="/A346468/b346468.txt">Table of n, a(n) for n = 1..20000</a>
%F A346468 a(n) = (n-1) / A346467(n).
%F A346468 a(n) = (n-1) / A002322(A027642(n-1)).
%t A346468 {0}~Join~Array[#/CarmichaelLambda@ Denominator@ BernoulliB@ # &, 89] (* _Michael De Vlieger_, Nov 23 2021 *)
%o A346468 (PARI) A346468(n) = if(1==n,0,my(m=1); fordiv(n-1,d,if(isprime(1+d),m = lcm(m,d))); ((n-1)/m));
%Y A346468 Cf. A002322, A027642, A248614, A317210, A346467.
%K A346468 nonn
%O A346468 1,4
%A A346468 _Antti Karttunen_ and _Thomas Ordowski_, Jul 22 2021