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 A359753 #4 Jan 28 2023 12:37:13
%S A359753 1,1,1,1,1,3,1,2,5,5,1,8,11,3,33,1,27,20,21,21,271,1,117,13,4,720,43,
%T A359753 149,143,2155,1,109,448,444,55,21963,85,19223,1247,279,17073,5,1,
%U A359753 15086,1835,13732,13851,760,675187,37,171,588,9558,73713,135669,144,1,8206,7254
%N A359753 a(n) is the number of subsets of the divisors of k which sum to k+1 where k is a number all of whose prime divisors are consecutive primes starting at 2.
%C A359753 This sequence might be used to split the positive integers into families of numbers that may or may not be a candidate for A359197(n).
%F A359753 a(n) = A359196(A055932(n)).
%e A359753 a(6) = 3 as A055932(6) = 12 and there are 12 subsets of the divisors of 12 which sum to 12+1 = 13 namely {1, 2, 4, 6}, {1, 12} and {3, 4, 6}.
%Y A359753 Cf. A055932, A359196.
%K A359753 nonn
%O A359753 1,6
%A A359753 _David A. Corneth_, Jan 17 2023