24519
domain: N
Appears in sequences
- Powers of fifth root of 3 rounded down.at n=46A018120
- Powers of fifth root of 9 rounded down.at n=23A018138
- Integer averages of two successive perfect powers (pp(n) + pp(n+1))/2.at n=32A075454
- Distinct-digit averages of two successive perfect powers (pp(n) + pp(n+1))/2.at n=20A075456
- Number of partitions of n into deficient numbers.at n=40A097797
- Number of partitions of the n-th deficient number into deficient numbers.at n=31A097799
- Numbers n such that Maple 9.5, Maple 10, Maple 11 and Maple 12 give the wrong answers for the number of partitions of n.at n=32A110375
- Recursive triangular symmetrical sequence: A(n,k) := (n - k + 1)A(n - 1, k - 1) + (k)* A(n - 1, k) - (n + 1)*A(n - 2, k - 1).at n=47A153479
- Recursive triangular symmetrical sequence: A(n,k) := (n - k + 1)A(n - 1, k - 1) + (k)* A(n - 1, k) - (n + 1)*A(n - 2, k - 1).at n=52A153479
- Numbers k such that Sum_{i=1..k} i^7 divides Product_{i=1..k} i^7.at n=24A166607
- Number of 4 X n 0..1 arrays with diagonals and rows unimodal and antidiagonals nondecreasing.at n=9A224160
- Numbers that are midway between the nearest square and the nearest cube.at n=23A233075
- Number of nX5 0..1 arrays with every element equal to 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=5A299311
- Number of nX6 0..1 arrays with every element equal to 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=4A299312
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=49A299314
- T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 4, 5, 6 or 7 king-move adjacent elements, with upper left element zero.at n=50A299314
- Number of Golomb partitions of n.at n=48A325858
- Number of ways to choose a sequence of integer partitions, one of each part of an integer partition of n into odd parts.at n=19A358825
- Number of ways to choose a sequence of partitions, one of each part of an odd-length partition of 2n+1 into odd parts.at n=9A358826