29128

Appears in sequences

• a(n) = ceiling(2^(n+1)/n).at n=17A053639
• A Jacobsthal trisection.at n=6A093134
• Numbers m such that m + sigma(m) is a repdigit.at n=20A116017
• a(n) = ceiling(4^n/n).at n=8A129788
• a(n) = 2*a(n-1) - a(n-3) + 2*a(n-4).at n=15A135350
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, 0), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 1)}.at n=8A151484
• Number of 5-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=19A187158
• a(n) = n^5 - n^4 + n^3 - n^2 + n.at n=8A191012
• Number of (n+3) X (1+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits.at n=14A262333
• a(n) = p(2*n)-p(2*n-2)-p(n) where p(n) are the partition numbers A000041(n).at n=22A263847
• Partial sums of A206032 (Product_{d|n} sigma(d)).at n=12A280085
• Numbers m > 0 that have a divisor d > 1 with binomial(m+d, d) == 1 mod m.at n=50A290040
• a(n+3) = 2^n - a(n), a(0)=a(2)=1, a(1)=0 for n >= 0.at n=18A328881