30613

Appears in sequences

• Numbers k that divide s(k), where s(1)=1, s(j)=23*s(j-1)+j.at n=10A014874
• Positive integers k such that k divides 12^k - 1.at n=9A014951
• Numbers k such that k | 10^k + 1.at n=9A015958
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 96 ones.at n=33A031864
• Number of partitions of n into parts not of the form 15k, 15k+7 or 15k-7. Also number of partitions with at most 6 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=43A035961
• Numbers k that divide 7^k + 4^k.at n=11A045592
• Numbers k that divide 6^k + 5^k.at n=11A045595
• Numbers n such that n | 7^n + 6^n + 5^n + 4^n.at n=17A057244
• Numbers k such that the sum of the Carmichael lambda functions of the divisors is a proper divisor of k.at n=21A131492
• Number of (w,x,y,z) with all terms in {0,...,n}, and w, x and y odd.at n=22A212763
• Numbers n dividing u(n), where the Lucas sequence is defined u(i) = u(i-1) - 3*u(i-2) with initial conditions u(0)=0, u(1)=1.at n=10A228440
• The number of distinct positions on an infinite chessboard reachable by the (3,4)-leaper in <= n moves.at n=23A297741
• Number of partitions of n with up to seven distinct kinds of 1.at n=26A320694
• a(n) is the n-th number m that divides n^m + 1 (or 0 if m does not exist).at n=9A333430
• 4-brilliant numbers: numbers which are the product of four primes having the same number of decimal digits.at n=44A376704
• a(n) is the (n-1)-st frugal number in base n.at n=28A379539