22902
domain: N
Appears in sequences
- Number of partitions of n into parts not of the form 21k, 21k+10 or 21k-10. Also number of partitions with at most 9 parts of size 1 and differences between parts at distance 9 are greater than 1.at n=39A035988
- Numbers k such that 165*2^k-1 is prime.at n=50A050834
- a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.at n=38A063676
- Coefficient of x in the reduction by x^2 -> x+1 of the polynomial p(n,x) defined at Comments.at n=15A192974
- Sum of all parts that are not the smallest part (counted with multiplicity) of all partitions of n.at n=22A213359
- Sum of the lengths of the arithmetic progressions in {1,2,3,...,n}, including trivial arithmetic progressions of lengths 1 and 2.at n=42A264100
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 238", based on the 5-celled von Neumann neighborhood.at n=40A270986
- a(n) = Sum_{k=1..n} k^2*sigma(k), where sigma is A000203.at n=14A319086
- Number of complete subsets of {1..n}.at n=17A326020
- Triangle read by rows: T(n, k) = n! * 3^k * hypergeom([-k], [-n], 1/3).at n=24A375447