402653185

Appears in sequences

• Cullen numbers: a(n) = n*2^n + 1.at n=24A002064
• a(0) = 1; thereafter a(n) = 3*2^(n-1) + 1.at n=28A004119
• Length of longest trail (i.e., path with all distinct edges) on the edges of an n-cube.at n=25A005985
• a(1) = 2, a(2) = 4; a(n) = 2*a(n-1) - 1.at n=28A103204
• a(n) = 3*2^n + 1.at n=27A181565
• a(n) = 6*4^n + 1.at n=13A199116
• a(n) = 3*8^n + 1.at n=9A199494
• a(n) = a(n-1) + 2*a(n-2) with n>1, a(0)=2, a(1)=7.at n=27A201630
• Half the number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having exactly two distinct clockwise edge differences.at n=17A209530
• a(0) = 1, a(n+1) = 2*a(n) + periodic sequence of length 2: repeat [5, -4].at n=27A280173
• a(0) = 3, a(n+1) = 2*a(n) + periodic sequence of length 2: repeat [1, -2].at n=27A280345
• Minimum m such that the convergence speed of m^^m is equal to n >= 2, where A317905(n) represents the convergence speed of m^^m (and m = A067251(n), the n-th non-multiple of 10).at n=25A337392
• a(n) is the smallest integer k greater than 1 and not a perfect power satisfying A373387(k^n) = n.at n=26A381949
• a(n) is the smallest integer k greater than 1 and not a perfect power satisfying A373387(k^n) = n.at n=31A381949