19514

Appears in sequences

• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Lucas numbers), t = A000201 (lower Wythoff sequence).at n=23A024474
• a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Lucas numbers), t = A000201 (lower Wythoff sequence).at n=22A025094
• Sin(n) decreases monotonically to -1.at n=32A046964
• a(0)=1; a(n) is the smallest integer > a(n-1) such that sin(a(n)) is closer to an integer (here 0 or -1) than sin(a(n-1)).at n=31A079037
• Expansion of x^4*(2+x)/((1+x)*(1-x)^5).at n=21A082289
• Expansion of (1+x+x^2)/((1+x^2)*(1+x)^4*(1-x)^5).at n=43A082290
• Fixed points of permutation A113821.at n=4A115640
• Numbers k such that tau(k) = tau(k+1) mod 691, where tau is Ramanujan's tau function A000594.at n=30A121733
• Number of binary strings of length n with no substrings equal to 0001 or 1000.at n=12A164398
• a(1) = 1, and for each k >=2, a(k) is the smallest number n such that n/cos(n) > a(k)/cos(a(k)), so that a(1)/cos(a(1)) > a(2)/cos(a(2)) > ... > a(k)/cos(a(k)) > ...at n=42A172446
• a(1) = 1, and for each n >=2, a(n) is the smallest number such that 1/cos(a(n)) < 1/cos(k) for all k < n, so that 1/cos(a(1)) > 1/cos(a(2)) > ... > 1/cos(a(n)) > ...at n=31A172448
• G.f.: exp( Sum_{n>=1} A005063(n)*x^n/n ), where A005063(n) = sum of squares of primes dividing n.at n=25A219224
• Number of nX5 0..1 arrays with every element equal to 0 or 1 horizontally or antidiagonally adjacent elements, with upper left element zero.at n=13A301787
• Convolution of central binomial coefficients and partition numbers.at n=8A304824
• Sequence lists numbers k > 1 such that k^3 == d(k) (mod sigma(k)), where d = A000005 and sigma = A000203.at n=9A323250
• Numbers k at which point A336459(k) appears multiplicative, but A051027(k) does not.at n=32A336561
• Index where n first appears in A381658.at n=56A381659