27309

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 96 ones.at n=26A031864
• a(n) = ceiling(a(n-1)*3/2) with a(1) = 1.at n=24A061419
• Number of numbers whose base-3/2 expansion (see A024629) has n digits.at n=24A081848
• a(1) = 1; for n > 1: if n is even, a(n) = least k > 0 such that sum(i=1,n/2,a(2*i-1))/sum(j=1,n,a(j))>=1/4, or 1 if there is no such k; if n is odd, a(n) = largest k > 0 such that sum(i=1,(n+1)/2,a(2*i-1))/sum(j=1,n,a(j))<=1/3, or 1 if there is no such k.at n=51A104740
• Numbers k such that k and 2*k, taken together are pandigital.at n=20A115922
• 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), (0, 0, -1), (0, 1, 0), (1, -1, 1)}.at n=10A148390
• Values of register b when register a becomes 0 for the two register machine {i[1], i[1], i[1], d[2,1], d[1,6], i[2], d[1,5], d[2,3]}.at n=24A156623
• Number of ordered triples (w,x,y) with all terms in {-n, ..., -1, 1, ..., n} and 5w + x + y > 0.at n=19A211630
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 299", based on the 5-celled von Neumann neighborhood.at n=33A271154
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+27298) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=14A283888
• a(n) = (5*2^n + 7*(-1)^n)/3.at n=14A344109
• a(n) is the result of n applications of the function f to n, where f(x) = floor((3*x + 1)/2) (A007494).at n=18A353220
• Table read by antidiagonals: T(m,n) = number of (m-2)-metered (m,n)-parking functions.at n=73A372821