49153

Appears in sequences

• Cullen numbers: a(n) = n*2^n + 1.at n=12A002064
• Numbers that are the sum of 4 positive 7th powers.at n=31A003371
• a(0) = 1; thereafter a(n) = 3*2^(n-1) + 1.at n=15A004119
• Length of longest trail (i.e., path with all distinct edges) on the edges of an n-cube.at n=13A005985
• Values of n such that Sum[ -(-1)^(k) n/k (n-1)/(k+1),{k,1,n}] (n!!) is an integer.at n=28A078621
• Starting at the integer 0, add one of each base-n digit in base n to a pile and then take from this pile the digits required to construct the current integer. Continue consecutively until reaching an integer, a(n), that requires digits not in the pile.at n=6A092955
• a(n) = 3*2^floor((n-1)/2) + (-1)^n.at n=29A097581
• Expansion of g.f.: (3+x+2*x^2-2*x^3)/((1-2*x)*(1+x^2)).at n=14A100720
• a(1) = 2, a(2) = 4; a(n) = 2*a(n-1) - 1.at n=15A103204
• Pierpont 3-almost primes. 3-almost primes of form (2^K)*(3^L)+1.at n=15A112797
• Row sums of triangle A130585.at n=12A130586
• a(n) = 3*4^n + 1.at n=7A140660
• a(n) = 48*n^2 + 1.at n=32A158638
• 13th-order Fibonacci numbers: a(n) = a(n-1) + ... + a(n-13) with a(1)=...=a(13)=1.at n=25A163551
• a(n) = 3*2^n + 1.at n=14A181565
• Coefficient of x in the reduction by x^2->x+1 of the polynomial p(n,x) defined at Comments.at n=11A193047
• Number of distinct values of Sum_{i=0..n} x(i)*binomial(n,i), where the x(i) have values in 0..6.at n=13A205541
• a(0)=0, a(1)=1, for n>1, a(n) = n<*>n, where k<*>m = k<+>k<+>...<+>k is the m-1-fold iteration of the operation <+> defined in A206853.at n=13A206960
• 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=29A209721
• Numbers of the form 2^k+3 or 3*2^k+1, k >= 2.at n=26A245179