20776

Appears in sequences

• Incrementally largest terms in the continued fraction for Pi-2 (cf. A001203).at n=5A007541
• Values of Newton-Gregory forward interpolating polynomial (1/3)*(n-1)*(2*n+3)*(2*n-1).at n=25A030440
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 17 ones.at n=21A031785
• Incrementally largest terms in the continued fraction for Pi.at n=5A033089
• 5-digit terms in the continued fraction for Pi.at n=0A048960
• a(n) = ceiling((3-sqrt(3))*4^(n-3)) + 1 for n>=2, a(1)=1.at n=9A094062
• a(n) = ceiling((3-sqrt(3))*4^(n-3)) + 1.at n=10A101360
• Number of Proth primes: number of primes of the form 1 + k*2^n with k odd and k < 2^n.at n=18A134876
• Distinct entries in continued fraction for Pi in the order of their appearance.at n=41A154883
• Number of reduced words of length n in the Weyl group B_49.at n=3A162204
• Number of reduced words of length n in the Weyl group D_49.at n=3A162469
• a(n) = 10n+12^n.at n=3A173393
• Composite numbers in continued fraction expansion of Pi (A001203).at n=100A185809
• Number of n X 3 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 4 binary array having a sum of zero, with rows and columns of the latter in lexicographically nondecreasing order.at n=10A227122
• a(n) = Fibonacci(p) mod p^2, where p = prime(n).at n=55A236395
• Number of (n+1)X(3+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal.at n=3A237010
• Number of (n+1)X(4+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal.at n=2A237011
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal.at n=17A237015
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal.at n=18A237015
• 0-additive sequence: a(n) is the smallest number larger than a(n-1) that is not the sum of any subset of earlier terms, starting with initial values {2, 5}.at n=17A244749