23401

Appears in sequences

• a(n) = 5^n + n^5.at n=6A001593
• a(n) = 6^n + n^6.at n=5A001594
• Numbers having four 5's in base 8.at n=21A043444
• a(n) = n^(n+1)+(n+1)^n.at n=5A051442
• Leyland numbers: 3, together with numbers expressible as n^k + k^n nontrivially, i.e., n,k > 1 (to avoid n = (n-1)^1 + 1^(n-1)).at n=26A076980
• Triangle read by rows: T(n,r) = n^r + r^n (1 <= r <= n).at n=19A093898
• Numbers k that divide the sum of the digits of 2^k * k!.at n=25A108861
• A symmetrical powers triangle sequence: t(n,m) = (m^(n - m) + (n - m)^m).at n=49A156353
• A symmetrical powers triangle sequence: t(n,m) = (m^(n - m) + (n - m)^m).at n=50A156353
• Triangle T(n, k) = k^(n-k) + (n-k)^k with T(0, 0) = 1, read by rows.at n=71A156354
• Triangle T(n, k) = k^(n-k) + (n-k)^k with T(0, 0) = 1, read by rows.at n=72A156354
• a(n) = 900*n + 1.at n=25A158407
• a(n) = 26*n^2 + 1.at n=30A158549
• Numbers of the form x^y + y^x, 1 < x < y.at n=21A173054
• p^(p+1) + (p+1)^p, where p = prime(n).at n=2A208506
• Number of 0..2 arrays of length n+5 with sum less than 6 in any length 6 subsequence (=less than 50% duty cycle).at n=5A212724
• T(n,k)=Number of 0..2 arrays of length n+2*k-1 with sum less than 2*k in any length 2k subsequence (=less than 50% duty cycle).at n=33A212729
• Number of 0..2 arrays of length 2*n+5 with sum less than 2*n in any length 2n subsequence (=less than 50% duty cycle).at n=2A212735
• Number of nondecreasing -4..4 vectors of length n whose dot product with some nondecreasing -4..4 vector equals n.at n=8A226407
• Let an integer with k+1 digits as n = d(k)*10^k + d(k-1)*10^(k-1) + ... + d(0)*10^0 and consider the transform T(n) = k*10^d(k) + (k-1)*10^d(k-1) + ... + 0*10^d(0). a(n) gives the fixed points of the transform T(n).at n=22A226767