22991
domain: N
Appears in sequences
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (F(2), F(3), ...), t = A001950 (upper Wythoff sequence).at n=23A024594
- s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A001950 (upper Wythoff sequence).at n=22A025108
- Schoenheim bound L_1(n,5,4).at n=37A036832
- T(n,n), array T as in A047030.at n=9A047032
- Numbers n such that n divides the (left) concatenation of all numbers <= n written in base 12 (most significant digit on right).at n=3A061965
- Nearest integer to log(n^n)^(1 + log(log(1 + n))).at n=27A062480
- Ulam's spiral (NNE spoke).at n=38A143861
- a(1)=1, a(2)=2, a(n)=a(n-1)+floor(a(n-2)*a(n-1)/(a(n-2)+a(n-1))).at n=30A173090
- The number of 5-alternating permutations of [n].at n=12A250260
- Composite numbers k = concat(x,LSD(k)) such that the sum of the aliquot parts of k is equal to the sum of the aliquot parts of x.at n=1A293480