43065
domain: N
Appears in sequences
- Expansion of 1/((1+x)*(1-x)^7).at n=16A001769
- Inverse Euler transform of A000931.at n=51A018243
- a(n) is square mod a(i), i < n; a(n) nonsquare; a(1) = 2.at n=19A034901
- Number of n-digit terms of A070153.at n=41A071297
- Odd admirable numbers: such that sigma(n) = 2n + 2d for some d | n.at n=12A109729
- Number of irreducible multiple zeta values at weight n.at n=51A113788
- Odd primitive abundant numbers n such that n = x^2 + x + y^2 with y^2 < 2*x; a subsequence of A006038.at n=7A136476
- Row sums of triangle defined in A113820.at n=29A160968
- Numbers n such that n^2 can be represented as sum of (at least two) consecutive cubes and n is not a triangular number.at n=33A163393
- a(n) is the Severi degree for curves of degree n and cogenus 2.at n=10A171108
- Number of n X 6 0..1 arrays with rows unimodal and columns nondecreasing.at n=7A225008
- Number of unimodal functions f:[n]->[2n] with f(1)<>1 and f(i)<>f(i+1).at n=6A226013
- The stonemason's problem: numbers n such that n^2 is the sum of more than three consecutive cubes, the cube 1 being disallowed.at n=34A238099
- Members of a pair (m,k) such that sigma(m) = sigma(k) = sigma(m+k), m < k where sigma = A000203.at n=17A239436
- Members of a pair (m,n) such that sigma(m) = sigma(n) = sigma(n-m), m < n where sigma = A000203.at n=34A239939
- Odd bi-unitary admirable numbers: the odd terms of A334972.at n=1A334973
- Odd infinitary admirable numbers: the odd terms of A334974.at n=1A334975
- Odd infinitary abundant numbers whose infinitary abundancy is closer to 2 than that of any smaller odd infinitary abundant number.at n=3A335055
- Weight multiplicities for the trivial representation of the Lie algebra E_8.at n=13A340522
- Admirable numbers with more divisors than any smaller admirable number.at n=6A364726