59048

Appears in sequences

• a(n) = 3^n - 1.at n=10A024023
• a(n) = 9^n-1.at n=5A024101
• a(n+1) = smallest number not containing any digits of a(n), working in base 3.at n=20A030439
• Dirichlet convolution of mu(n) with 3^(n-1).at n=10A034741
• Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 10.at n=19A043816
• Numbers that are repdigits in base 3.at n=20A048328
• Numbers that are repdigits in base 9.at n=40A048334
• Values of n^2 - 1 resulting from A050795.at n=20A050799
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=20A062318
• Positive numbers which are one less than a perfect square that is also another power.at n=20A062965
• Jordan function J_10(n).at n=2A069095
• Maximal cycle lengths in a certain class of one-dimensional cellular automata.at n=22A085589
• Maximal cycle lengths in a certain class of one-dimensional cellular automata.at n=47A085589
• Maximal cycle lengths in a certain class of one-dimensional cellular automata.at n=47A085590
• Maximal cycle lengths in a certain class of one-dimensional cellular automata.at n=22A085590
• Maximal term in Collatz-iteration started at 3^n-1.at n=9A087971
• Numbers whose set of base 9 digits is {0,8}.at n=31A097255
• a(n) = 0^n + 3^n - 1.at n=10A103453
• a(n) = 3^n - (-1)^n.at n=10A105723
• a(1)=1; then successively add 1, divide by 2, add 2 and then total up the last 4 terms.at n=37A112027