98305

Appears in sequences

• a(n) = (n-1)*2^n + 1.at n=13A000337
• a(0) = 1; thereafter a(n) = 3*2^(n-1) + 1.at n=16A004119
• Permutation of N induced by rotating the node 1 (the top node) right in the infinite planar binary tree shown at A065658.at n=35A065660
• Basis for code in A075926.at n=11A075927
• Values of n such that Sum[ -(-1)^(k) n/k (n-1)/(k+1),{k,1,n}] (n!!) is an integer.at n=30A078621
• Smallest composite number which is 1 more than the product of n (not necessarily distinct) prime numbers.at n=15A081547
• Duplicate of A000337.at n=13A082753
• a(n) = 3*2^floor((n-1)/2) + (-1)^n.at n=31A097581
• a(1) = 2, a(2) = 4; a(n) = 2*a(n-1) - 1.at n=16A103204
• a(n) = 1 + (144 + (50 + (35 + (10 + n)*n)*n)*n)*n/120.at n=24A145127
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 1), (0, 0, -1), (0, 1, -1), (1, 0, 1)}.at n=11A148624
• 13th-order Fibonacci numbers: a(n) = a(n-1) + ... + a(n-13) with a(1)=...=a(13)=1.at n=26A163551
• a(n) = 3*2^n + 1.at n=15A181565
• a(n) = 6*4^n + 1.at n=7A199116
• a(n) = 3*8^n + 1.at n=5A199494
• a(n) = a(n-1) + 2*a(n-2) with n>1, a(0)=2, a(1)=7.at n=15A201630
• 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=9A209530
• 1/4 the number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=31A209721
• Rectangular array giving all start values M(n, k), k >= 1, for Collatz sequences following the pattern (udd)^(n-1) ud, n >= 1, read by antidiagonals.at n=62A240222
• Numerators of the Akiyama-Tanigawa transform applied to 1/(n+1) with -1/2 instead of 1/2.at n=14A244605