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 A088850 #20 Jun 18 2025 03:18:18
%S A088850 0,0,1,1,1,1,2,1,0,4,0,1,3,1,4,2,1,3,0,3,2,4,3,3,2,5,4,6,11,2,6,5,8,8,
%T A088850 7,7,12,14,8,8,10,7,10,11,11,11,20,17,30,19,22,16,22,21,17,26,30,27,
%U A088850 30,22,23,35,35,26,28,32,49,28,50,45,51,56,44,43,49
%N A088850 Number of different values of k when A056239(k) = A056239(k+1) = n.
%C A088850 Also the number of different values k, such that both k and k+1 occur in row n of A215366. - _Alois P. Heinz_, Aug 09 2012
%H A088850 Amiram Eldar, <a href="/A088850/b088850.txt">Table of n, a(n) for n = 0..98</a>
%t A088850 a[n_] := Count[Differences[Sort[Times @@@ (Prime /@ IntegerPartitions[n])]], 1]; Array[a, 51, 0] (* _Amiram Eldar_, Jun 18 2025 *)
%o A088850 (PARI) a(n) = {my(v = List(), c = 0); forpart(p = n, listput(v, vecprod(apply(prime, Vec(p))))); v = vecsort(v); for(i = 1, #v-1, if(v[i+1] == v[i] + 1, c++)); c;} \\ _Amiram Eldar_, Jun 18 2025
%Y A088850 Cf. A056239, A215366.
%K A088850 nonn
%O A088850 0,7
%A A088850 _Naohiro Nomoto_, Nov 24 2003
%E A088850 a(16)-a(20) from _R. J. Mathar_, Sep 27 2011
%E A088850 a(21)-a(50) from _Alois P. Heinz_, Aug 09 2012
%E A088850 a(51)-a(74) from _Amiram Eldar_, Jun 18 2025