49151

Appears in sequences

• A nonlinear recurrence.at n=45A003073
• Woodall (or Riesel) numbers: n*2^n - 1.at n=11A003261
• Shifts left 2 places under "DGK" (bracelet, element, unlabeled) transform.at n=22A032237
• a(0) = 1; a(n) = 3*2^n - 1, for n > 0.at n=14A052940
• a(2n) = 2*2^n - 1, a(2n+1) = 3*2^n - 1.at n=29A052955
• a(0) = 0; for n > 0, a(n) = 3*2^(n-1) - 1.at n=15A055010
• Smallest number x > 1 such that phi(x) + sigma(x) = k*d(x)^n, i.e., the left-hand side is divisible by the n-th power of the number of divisors.at n=6A055470
• Duplicate of A055010.at n=15A060153
• a(n) = 48*n^2 - 1.at n=32A065532
• Variation on Ulam numbers: a(1) = 1; a(2) = 2; for n>2, a(n) = smallest (n odd) or largest (n even) number > a(n-1) that is a unique sum of two distinct earlier terms.at n=29A081026
• a(0) = 1; for n > 0, a(n) = 3*2^(n-1) - 1.at n=15A083329
• Add 1, double, add 1, double, etc.at n=29A083416
• Duplicate of A055010.at n=15A086219
• a(n) = 3*2^floor((n-1)/2) + (-1)^n.at n=28A097581
• Smallest semiprime with Hamming weight n (i.e., smallest semiprime with exactly n ones when written in binary), or -1 if no such number exists.at n=14A102029
• Slater-Velez permutation sequence of the 2nd kind.at n=28A129198
• 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, 0), (-1, 0, -1), (-1, 0, 0), (1, -1, 0), (1, 1, 1)}.at n=9A149545
• 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, 0), (-1, 0, 0), (-1, 1, -1), (1, 0, -1), (1, 1, 1)}.at n=9A149546
• a(n) = 3*2^n - 1.at n=14A153893
• Partial sums of Berstel sequence (A007420).at n=22A178885