19682

Appears in sequences

• a(n) = 3^n - 1.at n=9A024023
• a(n+1) = smallest number not containing any digits of a(n), working in base 3.at n=18A030439
• Number of sequences of length n with a_{i-1} < a_i <= a_1 + ... + a_{i-1} + 1.at n=6A036794
• Numbers having four 8's in base 9.at n=2A043488
• Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 9.at n=17A043807
• Numbers n such that number of runs in the base 3 representation of n is congruent to 1 mod 10.at n=17A043816
• Numbers that are repdigits in base 3.at n=18A048328
• T(n,n-3), array T as in A054110.at n=36A054112
• Number of rooted trees with n nodes and 4 leaves.at n=14A055279
• Array of values of Jordan function J_k(n) read by antidiagonals (version 2).at n=57A059380
• In the '3x+1' problem, take the sequence of starting values which set new records for the highest point of the trajectory before reaching 1 (A006884); sequence gives associated maximal value reached in the trajectory with that start.at n=6A060410
• Continued fraction for Sum_{k>=0} 1/3^(3^k).at n=36A061678
• Continued fraction for Sum_{k>=0} 1/3^(3^k).at n=11A061678
• Continued fraction for Sum_{k>=0} 1/3^(3^k).at n=59A061678
• Square array A(n,k) = A(n-1,k) + A(n-1, floor(k/2)) + A(n-1, floor(k/3)), with A(0,0) = 1, read by antidiagonals.at n=64A061980
• Numbers of the form 3^m - 1 or 2*3^m - 1; i.e., the union of sequences A048473 and A024023.at n=18A062318
• a(n) = n^3 - 1.at n=26A068601
• Jordan function J_9(n).at n=2A069094
• Position of A014486(n) in A075165, minus one.at n=53A075162
• a(n) = 3^n + (-1)^n - [1/(n+1)], where [] represents the floor function.at n=9A084182