34425

Appears in sequences

• Cubes written in base 6.at n=16A004636
• a(n) = 225*(n-1)*(n-2)/2.at n=16A027470
• Expansion of (1-x)/(1-3*x-3*x^2-3*x^3).at n=8A077836
• Number of primes less than 10^n which do not contain the digit 1.at n=5A091635
• Numbers, not ending with 0, that are "printer's errors".at n=1A096298
• Integers n such that if you insert between each of their digits either "*" (times), "^" (exponentiation), or "nothing" (so that two or more digits are merged to form an integer), then you can recover n in a nontrivial way (however, two "^" mustn't be adjacent - you must avoid decompositions containing a^b^c).at n=1A156322
• Integers n such that by inserting between their digits + or - or * or / or ^ or nothing (i.e., concatenate two digits) you recover n back in a nontrivial way.at n=22A157198
• Triangle read by rows: T(n,k) (1 <= k <= n-1, n >= 2) = d(2*(n-k)-1)*(d(2*n-2)/d(2*(n-k)-2) - d(2*n-3)/d(2*(n-k)-3)), where d = A006882 is the double factorial function.at n=18A202212
• Count of the first 10^n primes which do not contain the digit 1.at n=5A228413
• Number of distinct lines passing through at least three points in a triangular grid of side n.at n=39A234248
• 100-gonal numbers: a(n) = 98*n*(n-1)/2 + n.at n=27A261276
• Expansion of Sum_{i>=1} x^(i^3) / (1 - Sum_{j>=1} x^(j^3))^2.at n=39A281809
• Sum T(n,k) of the entries in the k-th last blocks of all set partitions of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=51A286232
• a(n) = Product_{1<=x<=n, n|(x^2-1)} x.at n=51A318909
• Numbers k in A228058 such that also A001065(k) is in A228058.at n=42A325380
• a(n) is the least term of A326835 whose number of divisors is n.at n=29A348199
• Lexicographically earliest sequence of distinct positive integers such that any two subsets with at least two terms have distinct variances.at n=17A382381