83349

Appears in sequences

• Numbers of the form 3^i*7^j with i, j >= 0.at n=38A003594
• Odd numbers k that divide phi(k)*sigma(k).at n=33A015706
• Numbers whose prime factors are 3 and 7.at n=22A033850
• Odd numbers divisible by exactly 8 primes (counted with multiplicity).at n=27A046321
• Seventh column of triangle A067417.at n=4A067422
• Numerators in the fractional coefficients that form the partial quotients of the continued fraction representation of the inverse tangent of 1/x.at n=10A110255
• Numerators in the coefficients that form the odd-indexed partial quotients of the continued fraction representation of the inverse tangent of 1/x.at n=5A110257
• Alternately multiply and divide, with a(1)=3 and a(1)=7.at n=8A174348
• Alternately multiply and divide, with a(1)=3 and a(1)=7.at n=11A174348
• Products of the 5th power of a prime and a distinct prime of the 3rd power (p^5*q^3).at n=8A179671
• Number of nondecreasing arrangements of 6 numbers x(i) in -(n+4)..(n+4) with the sum of sign(x(i))*x(i)^2 zero.at n=31A188006
• Strong Achilles numbers: Achilles numbers m such that phi(m) is also an Achilles number, where phi(m) denotes Euler's totient function of m.at n=31A194085
• a(n) = 21*a(n-2) + 7*a(n-3), with a(0)=a(1)=0, a(2)=9.at n=9A215484
• T(n,k)=Rolling cube footprints: number of nXk 0..7 arrays starting with 0 where 0..7 label vertices of a cube and every array movement to a horizontal or antidiagonal neighbor moves along a corresponding cube edge.at n=18A223331
• Rolling cube footprints: number of 4 X n 0..7 arrays starting with 0 where 0..7 label vertices of a cube and every array movement to a horizontal or antidiagonal neighbor moves along a corresponding cube edge.at n=2A223333
• a(n) = 9*n^3.at n=21A244728
• Number of nX3 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.at n=3A268088
• T(n,k)=Number of nXk 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.at n=18A268092
• Number of 4Xn 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.at n=2A268096
• G.f. A(x) satisfies: A(x) = A(x^2) + x * (1 + 4*x + x^2) / (1 - x)^4.at n=41A328408