Sequences
392,541 sequences
- a(n) is twice the least possible area enclosed by a convex lattice n-gon.A070911
a(n) is twice the least possible area enclosed by a convex lattice n-gon.
- Binary expansion of BesselI(0,2).A070912
Binary expansion of BesselI(0,2).
- Continued fraction expansion for BesselI(0,2).A070913
Continued fraction expansion for BesselI(0,2).
- Array read by antidiagonals giving number of paths up and left from (0,0) to (n,kn) where x/y <= k for all intermediate points.A070914
Array read by antidiagonals giving number of paths up and left from (0,0) to (n,kn) where x/y <= k for all intermediate points.
- Numbers having at most two distinct prime factors.A070915
Numbers having at most two distinct prime factors.
- a(1)=1, a(n) is the smallest integer >= a(n-1) such that a(n)*a(n-1) - 1 is prime.A070916
a(1)=1, a(n) is the smallest integer >= a(n-1) such that a(n)*a(n-1) - 1 is prime.
- Numbers n such that the number of steps to reach 1 in the "3x+1" (or Collatz) problem divides n.A070917
Numbers n such that the number of steps to reach 1 in the "3x+1" (or Collatz) problem divides n.
- Triangle of T(n,k) coefficients of polynomials with first n prime numbers as roots.A070918
Triangle of T(n,k) coefficients of polynomials with first n prime numbers as roots.
- a(n) = Card{ (x,y,z) | lcm(x,y,z)=n }.A070919
a(n) = Card{ (x,y,z) | lcm(x,y,z)=n }.
- a(n) = Card{ (x,y,z,u) | lcm(x,y,z,u)=n }.A070920
a(n) = Card{ (x,y,z,u) | lcm(x,y,z,u)=n }.
- a(n) = Card{ (x,y,z,u,v) | lcm(x,y,z,u,v)=n }.A070921
a(n) = Card{ (x,y,z,u,v) | lcm(x,y,z,u,v)=n }.
- First palindromic prime pyramids with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 2.A070922
First palindromic prime pyramids with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 2.
- a(n) is the smallest value >= 0 of the form x^3 - n^2.A070923
a(n) is the smallest value >= 0 of the form x^3 - n^2.
- Where A070871 sets a new record.A070924
Where A070871 sets a new record.
- Number of subsets of A = {1,2,...,n} that have the same center of gravity as A, i.e., (n+1)/2.A070925
Number of subsets of A = {1,2,...,n} that have the same center of gravity as A, i.e., (n+1)/2.
- Records in the Conway's alimentary function A070871.A070926
Records in the Conway's alimentary function A070871.
- Second palindromic prime pyramids with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 2.A070927
Second palindromic prime pyramids with a(1)=2 such that (number of digits in a(n+1)) = (number of digits in a(n)) + 2.
- Smallest integer >= 0 of the form x^4 - n^3.A070928
Smallest integer >= 0 of the form x^4 - n^3.
- Smallest integer >= 0 of the form x^2 - n^3.A070929
Smallest integer >= 0 of the form x^2 - n^3.
- Smallest integer >= 0 of the form x^3 - n^4.A070930
Smallest integer >= 0 of the form x^3 - n^4.
- Numbers k such that the smallest integer value >= 0 of the form x^3 - k^2 equals the smallest integer value >= 0 of the form x^2 - k^3.A070931
Numbers k such that the smallest integer value >= 0 of the form x^3 - k^2 equals the smallest integer value >= 0 of the form x^2 - k^3.
- Possible number of units in a finite (commutative or non-commutative) ring.A070932
Possible number of units in a finite (commutative or non-commutative) ring.
- Expansion of Product_{k>=1} 1/(1 - 2*t^k).A070933
Expansion of Product_{k>=1} 1/(1 - 2*t^k).
- Smallest prime equal to the sum of 2n+1 consecutive primes.A070934
Smallest prime equal to the sum of 2n+1 consecutive primes.
- Largest proper divisor of n^2.A070935
Largest proper divisor of n^2.
- Square array read by antidiagonals: T(n,k) = number of partitions of n into distinct parts, each no more than k.A070936
Square array read by antidiagonals: T(n,k) = number of partitions of n into distinct parts, each no more than k.
- Number of times maximal coefficient (A025591) appears in Product_{k<=n} (x^k + 1), i.e., number of times highest value appears in n-th row of A053632 or n-th column of A070936.A070937
Number of times maximal coefficient (A025591) appears in Product_{k<=n} (x^k + 1), i.e., number of times highest value appears in n-th row of A053632 or n-th column of A070936.
- Harshad numbers which terminate in their digital sum.A070938
Harshad numbers which terminate in their digital sum.
- Length of binary representation of n.A070939
Length of binary representation of n.
- Number of digits that must be counted from left to right to reach the last 1 in the binary representation of n.A070940
Number of digits that must be counted from left to right to reach the last 1 in the binary representation of n.
- Length of binary representation of 2n+1.A070941
Length of binary representation of 2n+1.
- Values of n such that the first n terms of A055265 constitute a permutation of {1,2,3,...,n}.A070942
Values of n such that the first n terms of A055265 constitute a permutation of {1,2,3,...,n}.
- Commuting elements: number of ordered pairs g, h in the group GL(2,Z_n) such that gh = hg.A070943
Commuting elements: number of ordered pairs g, h in the group GL(2,Z_n) such that gh = hg.
- Complement of A002036.A070944
Complement of A002036.
- Number of permutations on n letters that have only cycles of length 4 or less.A070945
Number of permutations on n letters that have only cycles of length 4 or less.
- Number of permutations on n letters that have only cycles of length 5 or less.A070946
Number of permutations on n letters that have only cycles of length 5 or less.
- Number of permutations on n letters that have only cycles of length 6 or less.A070947
Number of permutations on n letters that have only cycles of length 6 or less.
- a(0) = 1; a(n+1) = smallest number > a(n) such that a(0)*a(1)*...*a(n) + 1 is a square.A070948
a(0) = 1; a(n+1) = smallest number > a(n) such that a(0)*a(1)*...*a(n) + 1 is a square.
- Little Hankel transform of A002487.A070949
Little Hankel transform of A002487.
- Triangle read by rows giving successive states of cellular automaton generated by "Rule 30".A070950
Triangle read by rows giving successive states of cellular automaton generated by "Rule 30".
- Number of 0's in n-th row of triangle in A070950.A070951
Number of 0's in n-th row of triangle in A070950.
- Number of 1's in n-th generation of 1-D CA using Rule 30, started with a single 1.A070952
Number of 1's in n-th generation of 1-D CA using Rule 30, started with a single 1.
- Order of the group GU(n,2), the general unitary n X n matrices over the finite field GF(4).A070953
Order of the group GU(n,2), the general unitary n X n matrices over the finite field GF(4).
- Emirps which when concatenated with their reversals after a 0 make a palindromic prime of the form emirp0prime.A070954
Emirps which when concatenated with their reversals after a 0 make a palindromic prime of the form emirp0prime.
- Numbers k such that k concatenated with k-1 0's and its reversal is prime.A070955
Numbers k such that k concatenated with k-1 0's and its reversal is prime.
- Number of pairs (x,y) such that n = gcd(x,y) + lcm(x,y).A070956
Number of pairs (x,y) such that n = gcd(x,y) + lcm(x,y).
- Primes p such that the equation sigma(x) = p has no solution.A070957
Primes p such that the equation sigma(x) = p has no solution.
- Numbers n such that the largest digit of n is the same as the largest digit of (sum of digits of n).A070958
Numbers n such that the largest digit of n is the same as the largest digit of (sum of digits of n).
- First minimum value > 0 of the form x^3-k^2 when k > n^3.A070959
First minimum value > 0 of the form x^3-k^2 when k > n^3.
- a(1) = 1; a(n) = n!*(3/2) for n>=2.A070960
a(1) = 1; a(n) = n!*(3/2) for n>=2.