Sequences
392,541 sequences
- a(n) = n - prevprime(n).A049711
a(n) = n - prevprime(n).
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A048149.A049712
a(n) = Sum_{i=0..n} T(i,n-i), array T as in A048149.
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A048149.A049713
a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A048149.
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A048149.A049714
a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A048149.
- a(n)=T(n,0), array T as in A049747.A049715
a(n)=T(n,0), array T as in A049747.
- a(n) = 2*n + 1 - prevprime(2*n + 1).A049716
a(n) = 2*n + 1 - prevprime(2*n + 1).
- a(n) = T(n,n+1), array T as in A048149.A049717
a(n) = T(n,n+1), array T as in A048149.
- a(n)=T(n,n+2), array T as in A048149.A049718
a(n)=T(n,n+2), array T as in A048149.
- a(n)=T(n,n+3), array T as in A048149.A049719
a(n)=T(n,n+3), array T as in A048149.
- a(n)=T(n,1), array T as in A048149.A049720
a(n)=T(n,1), array T as in A048149.
- a(n)=T(n,2), array T as in A048149.A049721
a(n)=T(n,2), array T as in A048149.
- a(n)=T(n,3), array T as in A048149.A049722
a(n)=T(n,3), array T as in A048149.
- Array T read by diagonals; T(i,j)=number of lattice points (x,y) in closed right half-plane and circle with radius (0,0)-to-(i,j).A049723
Array T read by diagonals; T(i,j)=number of lattice points (x,y) in closed right half-plane and circle with radius (0,0)-to-(i,j).
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049723.A049724
a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049723.
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049723.A049725
a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049723.
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049723.A049726
a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049723.
- Array T read by diagonals; T(i,j)=number of lattice points in triangle (possibly degenerate) with vertices (0,0),(i,0),(i,j).A049727
Array T read by diagonals; T(i,j)=number of lattice points in triangle (possibly degenerate) with vertices (0,0),(i,0),(i,j).
- a(n)=T(n,n), array T as in A049723.A049728
a(n)=T(n,n), array T as in A049723.
- a(n)=T(n,n+1), array T as in A049723.A049729
a(n)=T(n,n+1), array T as in A049723.
- a(n)=T(n,n+2), array T as in A049723.A049730
a(n)=T(n,n+2), array T as in A049723.
- a(n)=T(n,n+3), array T as in A049723.A049731
a(n)=T(n,n+3), array T as in A049723.
- a(n)=T(n,1), array T as in A049723.A049732
a(n)=T(n,1), array T as in A049723.
- a(n)=T(n,2), array T as in A049723.A049733
a(n)=T(n,2), array T as in A049723.
- a(n)=T(n,3), array T as in A049723.A049734
a(n)=T(n,3), array T as in A049723.
- Array T(i,j) is the number of lattice points (x,y) in circle with radius (0,0)-to-(i,j), read by antidiagonals.A049735
Array T(i,j) is the number of lattice points (x,y) in circle with radius (0,0)-to-(i,j), read by antidiagonals.
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049735.A049736
a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049735.
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049735.A049737
a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049735.
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049735.A049738
a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049735.
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049727.A049739
a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049727.
- a(n)=T(n,n), array T as in A049735.A049740
a(n)=T(n,n), array T as in A049735.
- a(n)=T(n,n+1), array T as in A049735.A049741
a(n)=T(n,n+1), array T as in A049735.
- a(n)=T(n,n+2), array T as in A049735.A049742
a(n)=T(n,n+2), array T as in A049735.
- a(n)=T(n,n+3), array T as in A049735.A049743
a(n)=T(n,n+3), array T as in A049735.
- a(n)=T(n,1), array T as in A049735.A049744
a(n)=T(n,1), array T as in A049735.
- a(n)=T(n,2), array T as in A049735.A049745
a(n)=T(n,2), array T as in A049735.
- a(n)=T(n,3), array T as in A049735.A049746
a(n)=T(n,3), array T as in A049735.
- Array T read by diagonals; T(i,j)=number of directions from (0,0) to lattice points in first-quadrant portion of disk with radius (0,0)-to-(i,j).A049747
Array T read by diagonals; T(i,j)=number of directions from (0,0) to lattice points in first-quadrant portion of disk with radius (0,0)-to-(i,j).
- a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049747.A049748
a(n) = Sum_{i=0..n} T(i,n-i), array T as in A049747.
- a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049747.A049749
a(n) = Sum_{i=0..2n} (-1)^i * T(i,2n-i), array T as in A049747.
- a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.A049750
a(n) = Sum_{i=0..floor(n/2)} T(2i,n-2i), array T as in A049747.
- Array T read by diagonals; T(i,j)=number of directions from (0,0) to lattice points in closed disk with radius (0,0)-to-(i,j).A049751
Array T read by diagonals; T(i,j)=number of directions from (0,0) to lattice points in closed disk with radius (0,0)-to-(i,j).
- a(n) = T(n,n), array T as in A049747.A049752
a(n) = T(n,n), array T as in A049747.
- a(n) = T(n,n+1), array T as in A049747.A049753
a(n) = T(n,n+1), array T as in A049747.
- a(n) = T(n,n+2), array T as in A049747.A049754
a(n) = T(n,n+2), array T as in A049747.
- a(n) = T(n,n+3), array T as in A049747.A049755
a(n) = T(n,n+3), array T as in A049747.
- a(n) = T(n,1), array T as in A049747.A049756
a(n) = T(n,1), array T as in A049747.
- a(n) = T(n,2), array T as in A049747.A049757
a(n) = T(n,2), array T as in A049747.
- a(n) = T(n,3), array T as in A049747.A049758
a(n) = T(n,3), array T as in A049747.
- Triangular array T read by rows: T(n,k)=n^2 mod k, for k=1,2,...,n, n=1,2,...A049759
Triangular array T read by rows: T(n,k)=n^2 mod k, for k=1,2,...,n, n=1,2,...
- a(n) = Sum_{k=1..n} T(n,k), array T as in A049759.A049760
a(n) = Sum_{k=1..n} T(n,k), array T as in A049759.