Sequences
392,541 sequences
- a(n) = T(n,2), array T as in A049600.A049611
a(n) = T(n,2), array T as in A049600.
- a(n) = T(n,3), array T as in A049600.A049612
a(n) = T(n,3), array T as in A049600.
- a(n) = 2n - (largest prime < 2n-2).A049613
a(n) = 2n - (largest prime < 2n-2).
- n! divided by its squarefree kernel.A049614
n! divided by its squarefree kernel.
- Array T by antidiagonals; T(i,j) = number of lattice points (x,y) hidden from (i,j), where 0<=x<=i, 0<=y<=j; (x,y) is hidden if there is a lattice point (h,k) collinear with and between (x,y) and (i,j).A049615
Array T by antidiagonals; T(i,j) = number of lattice points (x,y) hidden from (i,j), where 0<=x<=i, 0<=y<=j; (x,y) is hidden if there is a lattice point (h,k) collinear with and between (x,y) and (i,j).
- a(n) = Sum_{i=1..n} T(i,n-i), where T is A049615.A049616
a(n) = Sum_{i=1..n} T(i,n-i), where T is A049615.
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i) where T is A049615.A049617
a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i) where T is A049615.
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i) where T is A049615.A049618
a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i) where T is A049615.
- a(n) = Sum_{i=0..floor((n+1)/2)} T(2i+1,n-2i-1) where T is A049615.A049619
a(n) = Sum_{i=0..floor((n+1)/2)} T(2i+1,n-2i-1) where T is A049615.
- a(n) = T(n,n), array T as in A049615.A049620
a(n) = T(n,n), array T as in A049615.
- a(n) = T(n,n+1), array T as in A049615.A049621
a(n) = T(n,n+1), array T as in A049615.
- a(n) = T(n,n+2), array T as in A049615.A049622
a(n) = T(n,n+2), array T as in A049615.
- a(n) = T(n,n+3), array T as in A049615.A049623
a(n) = T(n,n+3), array T as in A049615.
- Essentially the same as A032766.A049624
Essentially the same as A032766.
- Congruent to 1, 2, 4, 6, 8 or 9 mod 11, but with 2 instead of 1.A049625
Congruent to 1, 2, 4, 6, 8 or 9 mod 11, but with 2 instead of 1.
- a(n) = T(n,4), array T as in A049615.A049626
a(n) = T(n,4), array T as in A049615.
- Array T read by diagonals; T(i,j)=(i+1)*(j+1)-H(i,j), where H is the array in A049615; thus T(i,j) is the number of lattice points in rectangle having diagonal (0,0)-to-(i,j) that are visible from (i,j).A049627
Array T read by diagonals; T(i,j)=(i+1)*(j+1)-H(i,j), where H is the array in A049615; thus T(i,j) is the number of lattice points in rectangle having diagonal (0,0)-to-(i,j) that are visible from (i,j).
- a(n) = Sum_{i=0..n} T(i,n-i) where T is A049627.A049628
a(n) = Sum_{i=0..n} T(i,n-i) where T is A049627.
- a(n) = (F(6*n+5) - F(6*n+1))/4 = (F(6*n+4) + F(6*n+2))/4, where F = A000045.A049629
a(n) = (F(6*n+5) - F(6*n+1))/4 = (F(6*n+4) + F(6*n+2))/4, where F = A000045.
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i) where T is A049627.A049630
a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i) where T is A049627.
- a(n) = Sum_{i=0..floor(n/2)} T(2i+1,n-2i-1) where T is A049627.A049631
a(n) = Sum_{i=0..floor(n/2)} T(2i+1,n-2i-1) where T is A049627.
- a(n) = T(n,n), array T as in A049627.A049632
a(n) = T(n,n), array T as in A049627.
- a(n) = T(n,n+1), array T as in A049627.A049633
a(n) = T(n,n+1), array T as in A049627.
- a(n) = T(n,n+2), array T as in A049627.A049634
a(n) = T(n,n+2), array T as in A049627.
- a(n) = T(n,n+3), array T as in A049627.A049635
a(n) = T(n,n+3), array T as in A049627.
- Congruent to 0 or 2 mod 3, but not equal to 0 or 3.A049636
Congruent to 0 or 2 mod 3, but not equal to 0 or 3.
- Congruent to 2, 3, 6, 8, 10 or 12 mod 13, but not equal to 3.A049637
Congruent to 2, 3, 6, 8, 10 or 12 mod 13, but not equal to 3.
- a(n) = T(n,4), array T as in A049627.A049638
a(n) = T(n,4), array T as in A049627.
- Array T read by diagonals; T(i,j) = number of lines passing through (i,j) and at least two other lattice points (h,k) satisfying 0<=h<=i, 0<=k<=j.A049639
Array T read by diagonals; T(i,j) = number of lines passing through (i,j) and at least two other lattice points (h,k) satisfying 0<=h<=i, 0<=k<=j.
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049639.A049640
a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049639.
- a(n) = Sum_{i=0..n} ((-1)^i)*T(i,n-i), array T as in A049639.A049641
a(n) = Sum_{i=0..n} ((-1)^i)*T(i,n-i), array T as in A049639.
- Numbers k such that the number of divisors of k does not divide the sum of divisors of k.A049642
Numbers k such that the number of divisors of k does not divide the sum of divisors of k.
- Number of fractions in Farey series of order n.A049643
Number of fractions in Farey series of order n.
- T(n,n), array T given by A049639.A049644
T(n,n), array T given by A049639.
- Numbers k such that the square of the number of divisors of k divides the sum of the divisors of k.A049645
Numbers k such that the square of the number of divisors of k divides the sum of the divisors of k.
- a(n) = T(n,n+1), array T given by A049639.A049646
a(n) = T(n,n+1), array T given by A049639.
- a(n) = T(n,n+2), array T given by A049639.A049647
a(n) = T(n,n+2), array T given by A049639.
- T(n,n+1), array T as in A049687 and T(2n,2n+2), array T given by A049639.A049648
T(n,n+1), array T as in A049687 and T(2n,2n+2), array T given by A049639.
- T(n,n+3), array T given by A049639.A049649
T(n,n+3), array T given by A049639.
- Compositorial numbers (A036691) + 1.A049650
Compositorial numbers (A036691) + 1.
- a(n) = (F(3*n+1) - 1)/2, where F=A000045 (the Fibonacci sequence).A049651
a(n) = (F(3*n+1) - 1)/2, where F=A000045 (the Fibonacci sequence).
- a(n) = (F(3*n+2) - 1)/4, where F=A000045 (the Fibonacci sequence).A049652
a(n) = (F(3*n+2) - 1)/4, where F=A000045 (the Fibonacci sequence).
- a(n) = 2*n - prevprime(2*n).A049653
a(n) = 2*n - prevprime(2*n).
- a(n) = (F(8*n+1) - 1)/3 where F=A000045 (the Fibonacci sequence).A049654
a(n) = (F(8*n+1) - 1)/3 where F=A000045 (the Fibonacci sequence).
- a(n) = (F(8n+2)-1)/3, where F=A000045 (the Fibonacci sequence).A049655
a(n) = (F(8n+2)-1)/3, where F=A000045 (the Fibonacci sequence).
- a(n) = (F(8n+7)-1)/3, where F=A000045 (the Fibonacci sequence).A049656
a(n) = (F(8n+7)-1)/3, where F=A000045 (the Fibonacci sequence).
- a(n) = (F(8*n+3) - 2)/3, where F = A000045 (the Fibonacci sequence).A049657
a(n) = (F(8*n+3) - 2)/3, where F = A000045 (the Fibonacci sequence).
- a(n) = (F(8*n+5) - 2)/3, where F = A000045 (the Fibonacci sequence).A049658
a(n) = (F(8*n+5) - 2)/3, where F = A000045 (the Fibonacci sequence).
- a(n) = (F(8*n+6) - 2)/3, where F=A000045 (the Fibonacci sequence).A049659
a(n) = (F(8*n+6) - 2)/3, where F=A000045 (the Fibonacci sequence).
- a(n) = Fibonacci(6*n)/8.A049660
a(n) = Fibonacci(6*n)/8.