32773

Appears in sequences

• Strong pseudoprimes to base 71.at n=19A020297
• Strong pseudoprimes to base 97.at n=21A020323
• Numbers k such that 243*2^k+1 is prime.at n=26A032498
• Numbers having four 0's in base 8.at n=11A043424
• a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a power of 2".at n=43A079256
• a(n) = n^3 + 5.at n=32A084381
• a(1) = 11; a(n) = if n == 2 mod 3 then a(n-1)-3, if n == 0 mod 3 then a(n-1)-2, if n == 1 mod 3 then a(n-1)*2.at n=47A085688
• Expansion of e.g.f. LambertW(-x)/(x*(x-1)).at n=6A102743
• a(n) = n_{2^n}.at n=14A122624
• Triangle read by rows: T(n,k) = the number of Dyck paths of semilength n with k DUUU's.at n=24A135308
• 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, 0, 0), (0, 0, 1), (1, 0, -1), (1, 1, 0)}.at n=8A150468
• a(n) = 2^n + 5.at n=15A168614
• G.f.: A(x) = (1 + 21*x + 3*x^2 - x^3)/(1-x)^5.at n=12A183066
• (Signless) coefficient of x^k in the admittance polynomial of the connected antiregular graph A_n.at n=50A188286
• Table of the elementary symmetric functions a_k(1,2,3,4,6,...,n+1) (5 missing).at n=40A196844
• a(n) = 8^n + n.at n=5A226201
• Numbers of the form 5^j + 8^k, for j and k >= 0.at n=36A226823
• Numbers a(n) which are the minimum number of moves needed in a variation of the tower of Hanoi with 4 towers and n disks.at n=16A248604
• a(n) is the smallest n-bit number having the most common prime signature among n-bit numbers. (In case more than one prime signature is tied for most common, choose the smallest n-bit number whose prime signature is one of those tied.)at n=15A342172
• Numbers that are not the sum of distinct terms of A353889.at n=43A353919