Sequences
392,541 sequences
- a(n) = |{m : multiplicative order of n mod m = 6}|.A059911
a(n) = |{m : multiplicative order of n mod m = 6}|.
- Triangle T(n,k) of orders of n degree irreducible polynomials over GF(2) listed in ascending order, k=1..A059499(n).A059912
Triangle T(n,k) of orders of n degree irreducible polynomials over GF(2) listed in ascending order, k=1..A059499(n).
- Triangle T(n,k) of numbers of n degree irreducible polynomials over GF(2) which have order A059912(n,k), k=1..A059499(n).A059913
Triangle T(n,k) of numbers of n degree irreducible polynomials over GF(2) which have order A059912(n,k), k=1..A059499(n).
- Primes p such that x^3 = 2 has more than one solution mod p and the sum of the (three) solutions is 2*p.A059914
Primes p such that x^3 = 2 has more than one solution mod p and the sum of the (three) solutions is 2*p.
- A sequence f(n) of positive integers is called an F-sequence (in memory of Fibonacci) if it satisfies f(0)=0, f(1)=1, f(2)=2 and for all n > 2, either f(n) = f(n-1) + f(n-2) or f(n) = f(n-1) + f(n-3). A positive integer is called an F-number if it occurs in any F-sequence. Sequence gives numbers which are not F-numbers.A059915
A sequence f(n) of positive integers is called an F-sequence (in memory of Fibonacci) if it satisfies f(0)=0, f(1)=1, f(2)=2 and for all n > 2, either f(n) = f(n-1) + f(n-2) or f(n) = f(n-1) + f(n-3). A positive integer is called an F-number if it occurs in any F-sequence. Sequence gives numbers which are not F-numbers.
- Nonnegative integers that when written out in full in English have no repeated letter.A059916
Nonnegative integers that when written out in full in English have no repeated letter.
- a(n) = (3^(2^n) + 1)/2 = A059919(n)/2, n >= 0.A059917
a(n) = (3^(2^n) + 1)/2 = A059919(n)/2, n >= 0.
- a(n) = (3^(2^n)-1)/2.A059918
a(n) = (3^(2^n)-1)/2.
- Generalized Fermat numbers: 3^(2^n)+1, n >= 0.A059919
Generalized Fermat numbers: 3^(2^n)+1, n >= 0.
- If m/n = q + r/n (r < n, n,m >=1), then array a(m,n) = qr (meaning q followed by r). Read by antidiagonals.A059920
If m/n = q + r/n (r < n, n,m >=1), then array a(m,n) = qr (meaning q followed by r). Read by antidiagonals.
- a(n) = floor(n^((n+1)/n)).A059921
a(n) = floor(n^((n+1)/n)).
- Each term in the table is the product of the two terms above it + 1.A059922
Each term in the table is the product of the two terms above it + 1.
- a(n+1) is smallest number with a(n+1)^n > a(n)^(n+1).A059923
a(n+1) is smallest number with a(n+1)^n > a(n)^(n+1).
- Write the numbers from 1 to n^2 in a spiraling square; a(n) is the total of the sums of the two diagonals.A059924
Write the numbers from 1 to n^2 in a spiraling square; a(n) is the total of the sums of the two diagonals.
- Numbers n such that {n, n+2, n+6, n+8, n+30, n+32, n+36, n+38} are all prime.A059925
Numbers n such that {n, n+2, n+6, n+8, n+30, n+32, n+36, n+38} are all prime.
- Length of period of the continued fraction expansion of sqrt(2^n+1).A059926
Length of period of the continued fraction expansion of sqrt(2^n+1).
- Period of the continued fraction for sqrt(2^(2n+1)).A059927
Period of the continued fraction for sqrt(2^(2n+1)).
- The periodic point counting sequence for the toral automorphism given by the polynomial of (conjectural) smallest Mahler measure. The map is x -> Ax mod 1 for x in [0,1)^10, where A is the companion matrix for the polynomial x^10+x^9-x^7-x^6-x^5-x^4-x^3+x+1.A059928
The periodic point counting sequence for the toral automorphism given by the polynomial of (conjectural) smallest Mahler measure. The map is x -> Ax mod 1 for x in [0,1)^10, where A is the companion matrix for the polynomial x^10+x^9-x^7-x^6-x^5-x^4-x^3+x+1.
- a(n) = Fibonacci(n)*Fibonacci(n+2).A059929
a(n) = Fibonacci(n)*Fibonacci(n+2).
- Numbers n such that n and n^2 combined use different digits.A059930
Numbers n such that n and n^2 combined use different digits.
- Numbers n such that n and n^(1/2) combined use different digits.A059931
Numbers n such that n and n^(1/2) combined use different digits.
- a(n) is formed by concatenating the next prime(n) primes.A059932
a(n) is formed by concatenating the next prime(n) primes.
- Goodstein sequence starting with 16: to calculate a(n+1), write a(n) in the hereditary representation in base n+2, then bump the base to n+3, then subtract 1.A059933
Goodstein sequence starting with 16: to calculate a(n+1), write a(n) in the hereditary representation in base n+2, then bump the base to n+3, then subtract 1.
- Third step in Goodstein sequences, i.e., g(5) if g(2)=n: write g(4)=A057650(n) in hereditary representation base 4, bump to base 5, then subtract 1 to produce g(5).A059934
Third step in Goodstein sequences, i.e., g(5) if g(2)=n: write g(4)=A057650(n) in hereditary representation base 4, bump to base 5, then subtract 1 to produce g(5).
- Fourth step in Goodstein sequences, i.e., g(6) if g(2)=n: write g(5)=A059934(n) in hereditary representation base 5, bump to base 6, then subtract 1 to produce g(6).A059935
Fourth step in Goodstein sequences, i.e., g(6) if g(2)=n: write g(5)=A059934(n) in hereditary representation base 5, bump to base 6, then subtract 1 to produce g(6).
- Fifth step in Goodstein sequences, i.e., g(7) if g(2)=n: write g(6)=A059935(n) in hereditary representation base 6, bump to base 7, then subtract 1 to produce g(7).A059936
Fifth step in Goodstein sequences, i.e., g(7) if g(2)=n: write g(6)=A059935(n) in hereditary representation base 6, bump to base 7, then subtract 1 to produce g(7).
- Sum of binary numbers with n 1's and two (possibly leading) 0's.A059937
Sum of binary numbers with n 1's and two (possibly leading) 0's.
- Sum of binary numbers with n 1's and two (non-leading) 0's.A059938
Sum of binary numbers with n 1's and two (non-leading) 0's.
- a(n) = floor(log_2(n+1) - 1).A059939
a(n) = floor(log_2(n+1) - 1).
- Smallest prime p such that x = n is a solution mod p of x^3 = 2, or 0 if no such prime exists.A059940
Smallest prime p such that x = n is a solution mod p of x^3 = 2, or 0 if no such prime exists.
- Take the n-th number which is just a sequence of 1's and 2's (A007931): if the first k digits in order are the same as the last k digits in order then put 1 in the k-th from right digit of a(n), otherwise put a zero.A059941
Take the n-th number which is just a sequence of 1's and 2's (A007931): if the first k digits in order are the same as the last k digits in order then put 1 in the k-th from right digit of a(n), otherwise put a zero.
- A059941 translated from binary to decimal.A059942
A059941 translated from binary to decimal.
- Toss a fair coin and calculate the expected time until the n-th possible finite sequence of Heads and Tails first appears (ordered by length of sequence and alphabetical order so H, T, HH, HT, TH, TT, HHH, etc.).A059943
Toss a fair coin and calculate the expected time until the n-th possible finite sequence of Heads and Tails first appears (ordered by length of sequence and alphabetical order so H, T, HH, HT, TH, TT, HHH, etc.).
- Denominators of Maclaurin series coefficients for 2*cos(x/sqrt(3) + arctan(-sqrt(3))) = cos(x/sqrt(3)) + sqrt(3)*sin(x/sqrt(3)).A059944
Denominators of Maclaurin series coefficients for 2*cos(x/sqrt(3) + arctan(-sqrt(3))) = cos(x/sqrt(3)) + sqrt(3)*sin(x/sqrt(3)).
- Number of 4-block bicoverings of an n-set.A059945
Number of 4-block bicoverings of an n-set.
- Number of 5-block bicoverings of an n-set.A059946
Number of 5-block bicoverings of an n-set.
- Number of 6-block bicoverings of an n-set.A059947
Number of 6-block bicoverings of an n-set.
- Number of 7-block bicoverings of an n-set.A059948
Number of 7-block bicoverings of an n-set.
- Number of 8-block bicoverings of an n-set.A059949
Number of 8-block bicoverings of an n-set.
- Number of 9-block bicoverings of an n-set.A059950
Number of 9-block bicoverings of an n-set.
- Number of 10-block bicoverings of an n-set.A059951
Number of 10-block bicoverings of an n-set.
- Ordering of a deck of 52 cards after an in-shuffle.A059952
Ordering of a deck of 52 cards after an in-shuffle.
- Ordering of a deck of 52 cards after an out-shuffle.A059953
Ordering of a deck of 52 cards after an out-shuffle.
- Number of 2 X 2 matrices with elements from {0,1,2,...,n} and with Nim-Determinant 1. (The Nim-Determinant of the 2 X 2 matrix [a,b; c,d] is defined to be a*d xor b*c, where * denotes Nim-Multiplication.)A059954
Number of 2 X 2 matrices with elements from {0,1,2,...,n} and with Nim-Determinant 1. (The Nim-Determinant of the 2 X 2 matrix [a,b; c,d] is defined to be a*d xor b*c, where * denotes Nim-Multiplication.)
- a(n) = floor( prime(n)!/lcm(1..prime(n)) ) modulo prime(n).A059955
a(n) = floor( prime(n)!/lcm(1..prime(n)) ) modulo prime(n).
- Decimal expansion of 6/Pi^2.A059956
Decimal expansion of 6/Pi^2.
- Sum of number of distinct prime factors of n and n+1, or number of distinct prime factors of n(n+1) or of lcm(n,n+1).A059957
Sum of number of distinct prime factors of n and n+1, or number of distinct prime factors of n(n+1) or of lcm(n,n+1).
- Smallest number m such that m*(m+1) has at least n distinct prime factors.A059958
Smallest number m such that m*(m+1) has at least n distinct prime factors.
- Distance of 2^n from its nearest prime neighbor and in case of a tie, choose the smaller.A059959
Distance of 2^n from its nearest prime neighbor and in case of a tie, choose the smaller.
- Smaller term of a pair of twin primes such that prime factors of their average are only 2 and 3.A059960
Smaller term of a pair of twin primes such that prime factors of their average are only 2 and 3.