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 A092405 #22 Jul 27 2021 01:37:36
%S A092405 3,4,5,5,6,6,6,7,7,6,8,8,6,8,9,7,8,8,8,10,8,6,10,11,7,8,10,8,10,10,8,
%T A092405 10,8,8,13,11,6,8,12,10,10,10,8,12,10,6,12,13,9,10,10,8,10,12,12,12,8,
%U A092405 6,14,14,6,10,13,11,12,10,8,10,12,10,14,14,6,10,12,10,12,10,12,15,9,6,14,16
%N A092405 a(n) = tau(n) + tau(n+1), where tau(n) = A000005(n), the number of divisors of n.
%C A092405 If a child is born to an n-year-old parent, this is the number of times the age of the parent will be a multiple of the age of the child. E.g., if n = 27, this will happen at the ages (28, 1), (29, 1),(30, 2), (30, 3), (32, 4), (35, 7), (42, 14), (36, 9), (54, 27), (56, 28). - _Alexander Piperski_, Sep 10 2018
%H A092405 Antti Karttunen, <a href="/A092405/b092405.txt">Table of n, a(n) for n = 1..20000</a>
%F A092405 a(n) = A346562(n+1,n). - _Omar E. Pol_, Jul 23 2021
%t A092405 Total /@ Partition[Array[DivisorSigma[0, #] &, 85], 2, 1] (* _Michael De Vlieger_, Sep 18 2018 *)
%o A092405 (PARI) for(i=1,60,print1(","sigma(i,0)+sigma(i+1,0)))
%o A092405 (PARI) A092405(n) = (numdiv(n)+numdiv(1+n)); \\ _Antti Karttunen_, Oct 07 2017
%Y A092405 Cf. A000005, A092403, A175143, A346562.
%K A092405 nonn
%O A092405 1,1
%A A092405 _Jon Perry_, Mar 22 2004
%E A092405 Extended by _Ray Chandler_, Mar 05 2010