33000
domain: N
Appears in sequences
- Cubes written in base 8.at n=23A004638
- Area of more than one Pythagorean triangle.at n=27A009127
- Sum{T(i,n-i): i=0,1,...,n}, array T as in A047120.at n=16A047121
- Numbers k such that n | sigma_10(k) + phi(k)^10.at n=17A055704
- Numbers whose square has more than 2/3 of its digits the same.at n=24A060813
- Numbers k not in A065036 but such that tau(k) = omega(k)^3.at n=33A074853
- a(n) = Sum_{i=1..n} LookAndSay(i).at n=38A079664
- Irregular square reversible numbers. Numbers which when squared and written backwards give a square again, but don't satisfy reverse(n^2) = reverse(n)^2.at n=30A129914
- Numbers k such that k and k^2 use only the digits 0, 1, 3, 8 and 9.at n=52A136852
- Wiener index of the grid P_n x P_n, where P_n is the path graph on n vertices.at n=9A143945
- Records in A160256.at n=32A151545
- Integers that can be generated with a C/C++ expression that is shorter than their decimal representation.at n=32A168650
- Numbers whose decimal expansion contains only 0's and 3's.at n=24A169966
- Triangle T(n,k) with the real part of [x^k] of the series (1-x)^(n+1)* sum_{j=0..infinity} (2*j+1+i)^n*x^j in row n, column k.at n=30A179068
- Triangle T(n,k) with the real part of [x^k] of the series (1-x)^(n+1)* sum_{j=0..infinity} (2*j+1+i)^n*x^j in row n, column k.at n=33A179068
- Numbers with prime factorization p*q*r^3*s^3 (where p, q, r, s are distinct primes).at n=13A190108
- Smallest number k such that k^n is the sum of numbers in a twin prime pair.at n=35A195336
- Number of -n..n arrays x(0..3) of 4 elements with zero sum and nonzero second differences.at n=17A200554
- Numbers such that each digit is the sum of two or more other digits.at n=11A203591
- Sequence A261220 shown in factorial base: a(n) = A007623(A261220(n)).at n=52A260743