46212
domain: N
Appears in sequences
- Consider the Diophantine equation x^3 + y^3 = z^3 - 1 (x < y < z) or 'Fermat near misses'. The values of z (see A050787) are arranged in monotonically increasing order. Sequence gives values of y.at n=29A050789
- Integers n not of form 3m+2 such that for any integer k > 0, n*10^k+1 has a divisor in the set { 7, 11, 13, 37 }.at n=8A243969
- Expansion of e.g.f. Product_{i>=1, j>=1} 1/(1 - x^(i*j)/(i*j)).at n=7A318693
- G.f.: Sum_{n>=0} (n+1)*(n+2)*(n+3)/3! * (x + x^n)^n.at n=31A325999
- Number of integer partitions of n with fewer ones than greatest multiplicity.at n=46A382526