23170
domain: N
Appears in sequences
- Powers of sqrt(2) rounded down.at n=29A017910
- Powers of sqrt(2) rounded to nearest integer.at n=29A017911
- a(n) = A017911(n+1) = round(sqrt(2)^(n+1)).at n=28A057048
- Largest term in periodic part of continued fraction expansion of square root of 2^n + 1 or 0 if 2^n + 1 is a square.at n=26A077624
- Largest term in periodic part of continued fraction expansion of square root of -1+2^n or 0 if -1+2^n is square.at n=26A077625
- a(n) = (4*6^n - 3*5^n - 3^n)/6.at n=6A081678
- a(0)=1, a(n+1) = 2*a(n) + b(n+2), where b(n)=A004539(n) is the n-th bit in the binary expansion of sqrt(2).at n=14A084188
- a(0) = a(1) = 0; for n >= 2, a(n) = floor(sqrt(2^(n-2)-1)).at n=31A116601
- Integers n such that n^2 + k is a Mersenne number 2^m - 1 for some k < n and m odd.at n=9A144932
- The arithmetic mean of the n-th and (n+1)-st cubes, rounded down.at n=28A147656
- Number of ways to place 2 nonattacking bishops on an n X n board.at n=14A172123
- Number of 3-step one space for components leftwards or up, two space for components rightwards or down asymmetric quasi-queen's tours (antidiagonal moves become knight moves) on an n X n board summed over all starting positions.at n=20A187858
- Number of (w,x,y,z) with all terms in {1,...,n} and w<2x and y>=3z.at n=21A212511
- Number of binary words of length n with exactly one occurrence of subword 010 and exactly one occurrence of subword 101.at n=18A255386
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 278", based on the 5-celled von Neumann neighborhood.at n=41A271097
- Products of distinct numbers in A052963.at n=44A274453
- Numbers k such that Bernoulli number B_{k} has denominator 4686.at n=17A295770
- a(n) = n*(2*n - 3 - (-1)^n)*(11*n + (-1)^n)/24.at n=29A308026
- Nonexponential weird numbers: nonexponential abundant numbers (A348604) that are not equal to the sum of any subset of their nonexponential divisors.at n=35A348631
- (1+e)-weird numbers: (1+e)-abundant numbers k such that no subset of the aliquot (1+e)-divisors of k sums to k.at n=36A349285