cp's OEIS Frontend

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.

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.

Original entry on oeis.org

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, 149, 143, 2155, 1, 109, 448, 444, 55, 21963, 85, 19223, 1247, 279, 17073, 5, 1, 15086, 1835, 13732, 13851, 760, 675187, 37, 171, 588, 9558, 73713, 135669, 144, 1, 8206, 7254
Offset: 1

Views

Author

David A. Corneth, Jan 17 2023

Keywords

Comments

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).

Examples

			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}.
		

Crossrefs

Formula

a(n) = A359196(A055932(n)).