1594324

Appears in sequences

• Positions where A007600 increases.at n=39A007601
• a(n) = sigma_13(n), the sum of the 13th powers of the divisors of n.at n=2A013961
• n is equal to the number of 1's in all numbers <= n written in base 9.at n=22A014884
• Numerator of sum of -13th powers of divisors of n.at n=2A017689
• a(n) = 3^n + 1.at n=13A034472
• Sum of n-th powers of digits of n.at n=13A055207
• Numbers of the form (3^{mr}-1)/(3^r-1) for positive integers m, r.at n=36A076270
• Maximal term in Collatz-iteration started at 3^n+1.at n=13A087972
• Maximal term in Collatz-iteration started at 3^n.at n=11A087973
• Expansion of (1- 2*x - x^2)/((1-x)*(1-3*x)).at n=14A094388
• a(n) = 3^n + 1 - 0^n.at n=13A103457
• a(n) = 3^n - (-1)^n.at n=13A105723
• Pierpont 3-almost primes. 3-almost primes of form (2^K)*(3^L)+1.at n=30A112797
• Base 9 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-9 digits, for some k.at n=36A162234
• a(n) = smallest number that leads to a new cycle under the base-3 Kaprekar map of A164993.at n=25A165009
• Start at 1, then add the first term (which is one here) plus 1 for the second term; then add the second term plus 2 for the third term; then add the third term to the sum of the first and second term; this gives the fourth term. Restart the sequence by adding 1 to the fourth term, etc. (From a sixth grade math extra credit assignment).at n=38A167051
• Least primitive number k such that 1/k is in the Cantor set and the fraction 1/k has period n in base 3.at n=25A175174
• One third the number of n X 2 0..3 arrays with no element equal to its row sum plus its column sum mod 4.at n=6A183430
• T(n,k)=One third the number of nXk 0..3 arrays with no element equal to its row sum plus its column sum mod 4.at n=29A183433
• T(n,k)=One third the number of nXk 0..3 arrays with no element equal to its row sum plus its column sum mod 4.at n=34A183433