24577

Appears in sequences

• a(0) = 1; thereafter a(n) = 3*2^(n-1) + 1.at n=14A004119
• a(n) = n*2^(n-1) + 1.at n=12A005183
• a(n) = n*4^n + 1.at n=6A050915
• Numbers k such that 2^k mod k = 2^k mod k^2.at n=37A068535
• Values of n such that Sum[ -(-1)^(k) n/k (n-1)/(k+1),{k,1,n}] (n!!) is an integer.at n=26A078621
• a(n) = 3*2^floor((n-1)/2) + (-1)^n.at n=27A097581
• Expansion of g.f.: (3+x+2*x^2-2*x^3)/((1-2*x)*(1+x^2)).at n=13A100720
• a(1) = 2, a(2) = 4; a(n) = 2*a(n-1) - 1.at n=14A103204
• Pierpont semiprimes: semiprimes of the form (2^K)*(3^L)+1.at n=34A113432
• Numbers k that are not powers of 2 such that 2^k mod k = 2^k mod k^2; or A068535 with powers of 2 excluded.at n=22A125773
• a(n) = 24*n^2 + 1.at n=32A158547
• 13th-order Fibonacci numbers: a(n) = a(n-1) + ... + a(n-13) with a(1)=...=a(13)=1.at n=24A163551
• a(n) = 6n^3 + 1, solution z in Diophantine equation x^3 + y^3 = z^3 - 2. It may be considered a Fermat near miss by 2.at n=15A163827
• First nonzero value of (a^(p-1) - 1) mod p^2, for a > 0 coprime to the n-th Wieferich prime p.at n=1A178900
• a(n) = 3*2^n + 1.at n=13A181565
• Number of n X 2 array permutations with each element making a single king move.at n=6A189179
• Number of nX7 array permutations with each element making a single king move.at n=1A189184
• T(n,k) = Number of n X k array permutations with each element making a single king move.at n=34A189186
• T(n,k) = Number of n X k array permutations with each element making a single king move.at n=29A189186
• Number of nX7 array permutations with each element moving zero or one space horizontally, diagonally or antidiagonally.at n=1A189648