33332

Appears in sequences

• Number of partitions of n into parts not of the form 11k, 11k+4 or 11k-4. Also number of partitions with at most 3 parts of size 1 and differences between parts at distance 4 are greater than 1.at n=47A035947
• Number of ternary rooted trees with n nodes and height exactly 5.at n=19A036420
• Numbers having four 3's in base 10.at n=14A043504
• Numbers n such that n through n+6 are divisible by the same number of distinct primes.at n=12A045935
• Periodic points under the map A053392 that adds consecutive pairs of digits and concatenates them.at n=26A053393
• Numbers n for which there are exactly twelve k such that n = k + reverse(k).at n=29A072435
• Numbers with a digit sum of n and a maximum product of digits. In case of two identical products choose the largest number.at n=13A083178
• a(n) is the least positive integer in base 10 containing n threes that is divisible by n.at n=3A112895
• Numbers whose square starts with 4 identical digits.at n=32A132391
• a(n) = 4394*n - 1820.at n=7A156627
• a(j) = maximum value of n for each distinct increasing value of (Sum of the quadratic non-residues of prime(n) - Sum of the quadratic residues of prime(n)) / prime(n) for each j.at n=25A166263
• Increase each digit in the binary representation of n by 2.at n=30A176894
• Number of steps to compute the n-th prime in PRIMEGAME using Kilminster's Fractran program with only nine fractions.at n=11A183133
• List of primitive words over the alphabet {2,3}.at n=51A213971
• Number of partitions of n, where the difference between the number of odd parts and the number of even parts is 8.at n=51A240017
• a(n) = 3*(10^n - 4)/9.at n=5A323639
• The number of vertices formed on an isosceles triangle by straight line segments mutually connecting all vertices and all points that divide the two equal length sides into n equal parts; the base of the triangle contains no points other than its vertices.at n=19A333026
• Numbers whose square starts with exactly 4 identical digits.at n=31A346940
• Array read by rows: T(n,k) is the first number with n prime factors (counted with multiplicity) and n occurrences of decimal digit k.at n=33A375784
• T(n,k) is the number of permutations of [n] having exactly k pairs of integers i<j in [n] such that their cycle minima have opposite sorting order; triangle T(n,k), n>=0, 0<=k<=A125811(n)-1, read by rows.at n=54A381529