28424
domain: N
Appears in sequences
- a(n) = (n^3 + 2*n)/3.at n=44A006527
- Fibonacci sequence beginning 0, 11.at n=18A022345
- Number of partitions in parts not of the form 11k, 11k+3 or 11k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=47A035946
- a(n) = 2*sum(C(n,2k+1)*F(2k), k=0..floor((n-1)/2)), where F(n) are Fibonacci numbers A000045.at n=11A097040
- Real part of absolute Gaussian perfect numbers, in order of increasing magnitude.at n=41A102531
- Triangle read by rows: T(k,s) = binomial(k+s,2s+1)*(2k-1)*(2k+1)/(2s+3), k >= 1, 0 <= s <= k-1.at n=39A111126
- Triangle read by rows: T(k,s)=(2k-1)(2k+1)binomial(2k-s-1,2k-2s-1)/(2k-2s+1); k>=1, 0<=s<=k-1.at n=41A111127
- s(k)-s(j), where the pairs (k,j) are given by A205867 and A205868, and s(k) denotes the (k+1)-st Fibonacci number.at n=34A205869
- Number of arrays of n nonnegative integers with value i>0 appearing only after i-1 has appeared at least 3 times.at n=14A210540
- Number of superdiagonal partitions: partitions (p1, p2, p3, ...) of n such that pi >= i.at n=54A238873
- Expansion of psi(-x^3) / f(-x) in powers of x where psi(), f() are Ramanujan theta functions.at n=47A271593
- Number of (binary) max-heaps on n elements from the set {0,1} containing exactly five 0's.at n=38A326506
- Number of compositions (ordered partitions) of n into distinct parts, the least being 4.at n=48A339165
- Irregular table read by rows: T(n,k) is the number of k-gons, k>=2, among all distinct circles that can be constructed from the 4 vertices and the equally spaced 4*n points placed on the sides of a square when every pair of the 4 + 4*n points are connected by a circle and where the points lie at the ends of the circle's diameter.at n=39A373109