29127

Appears in sequences

• Divisors of 2^18 - 1.at n=28A003528
• Positions of remoteness 2 in Beans-Don't-Talk.at n=8A005698
• a(n) = 7*a(n-1) + 8*a(n-2), a(0) = 0, a(1) = 1.at n=6A015565
• Numbers j such that sigma(sigma(j)) = k*j for some k.at n=28A019278
• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (2,4)-perfect numbers.at n=2A019282
• Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k*n; sequence gives the (4,k)-perfect numbers.at n=50A019293
• In A015922, not in A033553.at n=34A033554
• Base-4 digits are, in order, the first n terms of the periodic sequence with initial period 1,3,0.at n=7A037597
• Base-8 palindromes that start with 7.at n=25A043027
• a(n) = floor(2^n/(n^2)).at n=23A060505
• a(n) = n^5 - n^4 + n^3 - n^2 + n - 1.at n=8A062159
• Squarefree part of 2^n-1 : the smallest number such that a(n)*(2^n-1) is a square.at n=17A069112
• Smallest k > 0 such that n*k + 1 is an n-th power.at n=8A076943
• Duplicate of A015565.at n=6A082310
• a(n) = (n+1)^(n-1)/(n+2) + (-1)^n/(n+2).at n=7A083063
• Sigma unitary-sigma perfect numbers: numbers m which satisfy the following equation for some integer k: sigma(usigma(m)) = k*m where usigma(m) is sum of unitary divisors of m.at n=25A083288
• Eventual period of a single cell in rule 150 cellular automaton in a cyclic universe of width n.at n=34A085588
• Start with the sequence [1, 1/2, 1/3, ..., 1/n]; form new sequence of n-1 terms by taking averages of successive terms; repeat until reach a single number F(n); a(n) = numerator of F(n).at n=17A090633
• a(n) = A062402(2^n+1).at n=14A096856
• Numbers whose set of base 8 digits is {0,7}.at n=21A097254