19561

Appears in sequences

• Divisors of 2^45 - 1.at n=14A003550
• Strong pseudoprimes to base 8.at n=16A020234
• Strong pseudoprimes to base 44.at n=16A020270
• Strong pseudoprimes to base 64.at n=41A020290
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 88 ones.at n=24A031856
• Odd composite numbers n, such that n, n+d, n*d and n/d are all odious (A000069) for every divisor d of n.at n=30A231558
• G.f.: (1-3*x+2*x^2+2*x^4+4*x^5)/((1-x)*(1-3*x-4*x^3)).at n=9A232231
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 566", based on the 5-celled von Neumann neighborhood.at n=36A272989
• Expansion of Sum_{k>=2} x^Fibonacci(k)/(1 - x^Fibonacci(k)) / Product_{k>=2} (1 - x^Fibonacci(k)).at n=37A281689
• Number of nX4 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=5A297947
• Number of nX6 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=3A297949
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=39A297951
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=41A297951
• Number of nX4 0..1 arrays with every element equal to 1, 2, 3, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=4A301350
• Number of nX5 0..1 arrays with every element equal to 1, 2, 3, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=3A301351
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=31A301354
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 1, 2, 3, 5 or 6 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=32A301354
• a(1) = 1; a(n) = a(n-1) + Sum_{k=2..n} a(floor(n/k)).at n=43A351620
• G.f. satisfies A(x) = exp( Sum_{k>=1} ((-2)^k + A(x^k)) * x^k/k ).at n=18A363578
• Number of integer partitions of n with all distinct lengths of maximal gapless runs (decreasing by 0 or 1).at n=40A384884