35448
domain: N
Appears in sequences
- Number of ways to partition the sum of all divisors of n (sigma(n), A000203) into distinct positive integers not greater than n.at n=45A079125
- Triangular array related to tennis ball problem, read by rows.at n=59A079521
- The number of rectangles (orthogonal or not) with corners on an n X n grid of points.at n=16A085582
- Sum of the differences between the largest part and smallest part over all partitions of n into distinct parts.at n=44A117455
- Number of base 28 circular n-digit numbers with adjacent digits differing by 3 or less.at n=5A125338
- Numbers k such that k^2 divides 2*Fibonacci(k).at n=10A130163
- Number of nondecreasing arrangements of n+2 numbers in 0..n with the last equal to n and each after the second equal to the sum of one or two of the preceding four.at n=14A189319
- Number of n X 3 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.at n=27A207106
- Number n such that Fibonacci(n) is divisible by n, n + 1 and n - 1.at n=10A221018
- Number of subsets of {1,2,...,n-12} without differences equal to 2, 4, 6, 8, 10 or 12.at n=53A224813
- Sum_{i=1..n} Sum_{j=1..n} (i OR j), where OR is the binary logical OR operator.at n=35A258438
- Upper (1/5,1/2) midsequence of (3^n) and (5*n); see Comments.at n=11A390564