22468
domain: N
Appears in sequences
- Number of permutations of order n with the length of longest run equal to 5.at n=8A001253
- From rook polynomials.at n=11A001925
- Triangle read by rows: number of permutations of 1..n by length of longest run.at n=32A010026
- Cycle class sequence c(n) (the number of true cycles of length n in which a certain node is included) for zeolite MOR = Mordenite Na8[Al8Si40O96].24H2O starting with a T3 atom.at n=13A019181
- Numerators of continued fraction convergents to sqrt(760).at n=7A042464
- Sum of the 4th powers of the divisors of n is divisible by n.at n=11A046764
- Numbers n such that n | sigma_12(n).at n=26A055716
- Numbers m such that DivisorSigma(8*k-4, m) mod m = 0 holds presumably for all k; that is, (8*k-4)-power-sums of divisors of m are divisible by m for all k.at n=5A066291
- a(n) = 10000*n + 2468.at n=2A102689
- Number of 4-element nondividing subsets of {1, 2, ..., n}.at n=34A187491
- Triangle read by rows: number of permutations of 1..n by length l of longest run (n >= 1, 1 <= l <= n).at n=40A211318
- Number of positive subset sums of strict integer partitions of n.at n=38A284640
- Number of ways of placing A352241(n) nonattacking black-square queens on an n X n board.at n=19A352325
- Number of ways of placing A352426(n) nonattacking white-square queens on an n X n board.at n=19A352599
- Let operator D(n) be the number formed by concatenation of the products of the decimal digits of n by their respective multiplicities. This sequence records the smallest number requiring n iterations of D to reach a stationary number; see Comment and Example.at n=6A378022