47239

Appears in sequences

• Let c(k) denote the k-th composite number and p(k) the k-th prime number; then a(n) = Sum_{i=n*(n-1)/2+1 .. n*(n+1)/2} c(i) - Sum_{i=1..n} p(i).at n=43A024850
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 59 ones.at n=1A031827
• Number of 3 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.at n=6A069325
• Number of 7 X n binary arrays with path of adjacent 1's from upper right corner to lower left corner.at n=2A069329
• Numbers k such that phi(k) is a perfect sixth power.at n=25A078166
• a(n) = (4*9^n + (-1)^n)/5.at n=5A083302
• a(n) = 14 + floor( (1 + Sum_{j=0..n-1} a(j)) / 2).at n=20A120141
• Row sums of A285116: a(n) = 2 + Sum_{k=1..(n-1)} (C(n-1,k-1) bitwise-or C(n-1,k)), a(0) = 1, a(1) = 2.at n=16A285113
• Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with a path of adjacent 1's from upper right corner to lower left corner.at n=38A359575
• Array read by antidiagonals: T(m,n) is the number of m X n binary arrays with a path of adjacent 1's from upper right corner to lower left corner.at n=42A359575