Sequences
392,541 sequences
- a(n) = (Fibonacci(6*n+1) - 1)/4.A049661
a(n) = (Fibonacci(6*n+1) - 1)/4.
- a(n) = (F(6*n+2)-1)/4, where F=A000045 (the Fibonacci sequence).A049662
a(n) = (F(6*n+2)-1)/4, where F=A000045 (the Fibonacci sequence).
- a(n) = (F(6*n+5) - 1)/4, where F = A000045 (the Fibonacci sequence).A049663
a(n) = (F(6*n+5) - 1)/4, where F = A000045 (the Fibonacci sequence).
- a(n) = (F(6*n+3) - 2)/32, where F = A000045 (the Fibonacci sequence).A049664
a(n) = (F(6*n+3) - 2)/32, where F = A000045 (the Fibonacci sequence).
- a(n) = (F(6*n+4) - 3)/4, where F=A000045 (the Fibonacci sequence).A049665
a(n) = (F(6*n+4) - 3)/4, where F=A000045 (the Fibonacci sequence).
- a(n) = Fibonacci(5*n)/5.A049666
a(n) = Fibonacci(5*n)/5.
- a(n) = Fibonacci(7*n)/13.A049667
a(n) = Fibonacci(7*n)/13.
- a(n) = Fibonacci(8*n)/21.A049668
a(n) = Fibonacci(8*n)/21.
- a(n) = Fibonacci(9*n)/34.A049669
a(n) = Fibonacci(9*n)/34.
- a(n) = Fibonacci(10*n)/55.A049670
a(n) = Fibonacci(10*n)/55.
- a(n) = (F(n) + F(4*n))/2, where F=A000045 (the Fibonacci sequence).A049671
a(n) = (F(n) + F(4*n))/2, where F=A000045 (the Fibonacci sequence).
- a(n) = (F(4*n) - F(n))/2, where F=A000045 (the Fibonacci sequence).A049672
a(n) = (F(4*n) - F(n))/2, where F=A000045 (the Fibonacci sequence).
- a(n) = (F(3n) + F(n))/3, where F = A000045 (the Fibonacci sequence).A049673
a(n) = (F(3n) + F(n))/3, where F = A000045 (the Fibonacci sequence).
- a(n) = (F(3*n) - 2*F(n))/6, where F=A000045 (the Fibonacci sequence).A049674
a(n) = (F(3*n) - 2*F(n))/6, where F=A000045 (the Fibonacci sequence).
- a(n) = (2*F(3*n) - F(n))/3, where F=A000045 (the Fibonacci sequence).A049675
a(n) = (2*F(3*n) - F(n))/3, where F=A000045 (the Fibonacci sequence).
- a(n) = (F(8*n+3) + F(8*n+1))/3, where F = A000045 (the Fibonacci sequence).A049676
a(n) = (F(8*n+3) + F(8*n+1))/3, where F = A000045 (the Fibonacci sequence).
- a(n) = (F(8*n+6) + F(8*n+1))/3, where F = A000045 (the Fibonacci sequence).A049677
a(n) = (F(8*n+6) + F(8*n+1))/3, where F = A000045 (the Fibonacci sequence).
- a(n) = F(8*n+4)/3, where F=A000045 (the Fibonacci sequence).A049678
a(n) = F(8*n+4)/3, where F=A000045 (the Fibonacci sequence).
- a(n) = (F(8*n+7)+F(8*n+5))/3, where F=A000045 (the Fibonacci sequence).A049679
a(n) = (F(8*n+7)+F(8*n+5))/3, where F=A000045 (the Fibonacci sequence).
- a(n) = (L(n) + L(2*n))/2, where L = A000032 (the Lucas sequence).A049680
a(n) = (L(n) + L(2*n))/2, where L = A000032 (the Lucas sequence).
- a(n) = (Lucas(2*n) - Lucas(n))/2.A049681
a(n) = (Lucas(2*n) - Lucas(n))/2.
- a(n) = (Lucas(8*n) - 2)/45.A049682
a(n) = (Lucas(8*n) - 2)/45.
- a(n) = (Lucas(6*n) - 2)/16.A049683
a(n) = (Lucas(6*n) - 2)/16.
- a(n) = Fibonacci(2n)^2.A049684
a(n) = Fibonacci(2n)^2.
- a(n) = L(4*n+2)/3, where L=A000032 (the Lucas sequence).A049685
a(n) = L(4*n+2)/3, where L=A000032 (the Lucas sequence).
- a(n) = Fibonacci(8n)/3.A049686
a(n) = Fibonacci(8n)/3.
- Array T read by diagonals: T(i,j)=number of lines passing through (0,0) and at least one other lattice point (h,k) satisfying 0<=h<=i, 0<=k<=j.A049687
Array T read by diagonals: T(i,j)=number of lines passing through (0,0) and at least one other lattice point (h,k) satisfying 0<=h<=i, 0<=k<=j.
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049687.A049688
a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049687.
- a(n)=Sum{((-1)^(i+1))*T(i,n-i): i=0,1,...,n}, array T as in A049687.A049689
a(n)=Sum{((-1)^(i+1))*T(i,n-i): i=0,1,...,n}, array T as in A049687.
- a(n) = Sum_{k=1..n} phi(2*k), where phi = Euler totient function, cf. A000010.A049690
a(n) = Sum_{k=1..n} phi(2*k), where phi = Euler totient function, cf. A000010.
- a(n)=T(n,n), array T as in A049687. Also a(n)=T(2n,2n), array T given by A049639.A049691
a(n)=T(n,n), array T as in A049687. Also a(n)=T(2n,2n), array T given by A049639.
- Numbers k such that the square of the number of divisors of k does not divide the sum of the divisors of k.A049692
Numbers k such that the square of the number of divisors of k does not divide the sum of the divisors of k.
- a(n) = T(n,n+2), array T as in A049687.A049693
a(n) = T(n,n+2), array T as in A049687.
- a(n) = T(n,n+3), array T as in A049687.A049694
a(n) = T(n,n+3), array T as in A049687.
- Array T read by diagonals; T(i,j) is the number of nonnegative slopes of lines determined by 2 lattice points in [ 0,i ] X [ 0,j ] if i > 0; T(0,j)=1 if j > 0; T(0,0)=0.A049695
Array T read by diagonals; T(i,j) is the number of nonnegative slopes of lines determined by 2 lattice points in [ 0,i ] X [ 0,j ] if i > 0; T(0,j)=1 if j > 0; T(0,0)=0.
- a(n)=T(n,n), array T as in A049695.A049696
a(n)=T(n,n), array T as in A049695.
- a(n)=T(n,n+1), array T as in A049695.A049697
a(n)=T(n,n+1), array T as in A049695.
- a(n) = T(n,n+2), array T as in A049695.A049698
a(n) = T(n,n+2), array T as in A049695.
- a(n) = T(n,n+3), array T as in A049695.A049699
a(n) = T(n,n+3), array T as in A049695.
- a(n) = Max_{i=0..n} T(i,n-i), array T as in A049695.A049700
a(n) = Max_{i=0..n} T(i,n-i), array T as in A049695.
- Duplicate of A005598.A049701
Duplicate of A005598.
- Array T read by diagonals; T(i,j)=number of directions determined by 2 lattice points in [ 0,i ]x[ 0,j ].A049702
Array T read by diagonals; T(i,j)=number of directions determined by 2 lattice points in [ 0,i ]x[ 0,j ].
- a(0) = 0; for n>0, a(n) = A005598(n)/2.A049703
a(0) = 0; for n>0, a(n) = A005598(n)/2.
- Array T read by antidiagonals; T(i,j)=number of nonnegative slopes of lines determined by two points in the triangular set {(x,y): 0<=x<=i, 0<=y<=j-j*x/i} of lattice points.A049704
Array T read by antidiagonals; T(i,j)=number of nonnegative slopes of lines determined by two points in the triangular set {(x,y): 0<=x<=i, 0<=y<=j-j*x/i} of lattice points.
- a(n)=3-k(n), where k=A000002=Kolakoski sequence; also the sequence of runlengths of a is k.A049705
a(n)=3-k(n), where k=A000002=Kolakoski sequence; also the sequence of runlengths of a is k.
- a(n) = T(n,n+2), array T as in A049704.A049706
a(n) = T(n,n+2), array T as in A049704.
- a(n) = T(n,n+3), array T as in A049704.A049707
a(n) = T(n,n+3), array T as in A049704.
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049704.A049708
a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049704.
- a(n) = (1/2) * Sum_{i=0..n} T(i,n-i), array T as in A049704.A049709
a(n) = (1/2) * Sum_{i=0..n} T(i,n-i), array T as in A049704.
- a(n)=3-k(n), where k=A006928; also, a and k have the same runlength sequence, with n-th term k(n-1) for n >= 2.A049710
a(n)=3-k(n), where k=A006928; also, a and k have the same runlength sequence, with n-th term k(n-1) for n >= 2.