Sequences
392,541 sequences
- Numbers k such that prime(k) == 1 (mod 10).A049511
Numbers k such that prime(k) == 1 (mod 10).
- Number of quasi-initially connected digraphs on n unlabeled nodes.A049512
Number of quasi-initially connected digraphs on n unlabeled nodes.
- Array T by antidiagonals: T(k,n) = k*n*2^(n-1) + 1, n >= 0, k >= 0.A049513
Array T by antidiagonals: T(k,n) = k*n*2^(n-1) + 1, n >= 0, k >= 0.
- Starting index of a string of 2 or more consecutive equal digits in decimal expansion of Pi.A049514
Starting index of a string of 2 or more consecutive equal digits in decimal expansion of Pi.
- Starting index of a string of 3 or more consecutive equal digits in decimal expansion of Pi.A049515
Starting index of a string of 3 or more consecutive equal digits in decimal expansion of Pi.
- Starting index of a string of 4 or more consecutive equal digits in decimal expansion of Pi.A049516
Starting index of a string of 4 or more consecutive equal digits in decimal expansion of Pi.
- Starting index of a string of 5 or more consecutive equal digits in decimal expansion of Pi.A049517
Starting index of a string of 5 or more consecutive equal digits in decimal expansion of Pi.
- Starting index of a string of exactly 2 consecutive equal digits in the decimal expansion of Pi.A049518
Starting index of a string of exactly 2 consecutive equal digits in the decimal expansion of Pi.
- Starting index of a string of exactly 3 consecutive equal digits in decimal expansion of Pi.A049519
Starting index of a string of exactly 3 consecutive equal digits in decimal expansion of Pi.
- Starting index of a string of exactly 4 consecutive equal digits in decimal expansion of Pi.A049520
Starting index of a string of exactly 4 consecutive equal digits in decimal expansion of Pi.
- Starting index of a string of exactly 5 consecutive equal digits in decimal expansion of Pi.A049521
Starting index of a string of exactly 5 consecutive equal digits in decimal expansion of Pi.
- Smallest starting index for a run of at least n consecutive equal digits in decimal expansion of Pi.A049522
Smallest starting index for a run of at least n consecutive equal digits in decimal expansion of Pi.
- Smallest starting index for a run of exactly n consecutive equal digits in decimal expansion of Pi.A049523
Smallest starting index for a run of exactly n consecutive equal digits in decimal expansion of Pi.
- Number of digraphs with a source and a sink on n labeled nodes.A049524
Number of digraphs with a source and a sink on n labeled nodes.
- I is the first, second, eighth, ... letter in this sentence not counting spaces or commas.A049525
I is the first, second, eighth, ... letter in this sentence not counting spaces or commas.
- Number of possible sets {{row sums}, {column sums}} of a 2n X 2n matrix with entries from {0,1,-1} and all row and column sums distinct.A049526
Number of possible sets {{row sums}, {column sums}} of a 2n X 2n matrix with entries from {0,1,-1} and all row and column sums distinct.
- Number of possible sets {{row sums},{column sums}} of an n X n+1 matrix with entries from {0,1,-1} and all row and column sums distinct.A049527
Number of possible sets {{row sums},{column sums}} of an n X n+1 matrix with entries from {0,1,-1} and all row and column sums distinct.
- Number of letters in n-th prime (in English).A049528
Number of letters in n-th prime (in English).
- Numbers k such that sum of factorials of digits of k equals pi(k) (A000720).A049529
Numbers k such that sum of factorials of digits of k equals pi(k) (A000720).
- pi(n) associated with A049529.A049530
pi(n) associated with A049529.
- Number of digraphs with a source and a sink on n unlabeled nodes.A049531
Number of digraphs with a source and a sink on n unlabeled nodes.
- Numbers k such that k^2 + 1 is not squarefree.A049532
Numbers k such that k^2 + 1 is not squarefree.
- Numbers k such that k^2+1 is squarefree.A049533
Numbers k such that k^2+1 is squarefree.
- Starting index of a string of 6 or more consecutive equal digits in decimal expansion of Pi.A049534
Starting index of a string of 6 or more consecutive equal digits in decimal expansion of Pi.
- Starts of runs of exactly 6 consecutive nonsquarefree numbers.A049535
Starts of runs of exactly 6 consecutive nonsquarefree numbers.
- Primes of the form lcm(1, ..., n) + 1 = A003418(n) + 1.A049536
Primes of the form lcm(1, ..., n) + 1 = A003418(n) + 1.
- Values of k for which A075059(k) = A003418(k) + 1 is prime.A049537
Values of k for which A075059(k) = A003418(k) + 1 is prime.
- Number of distinct binary sequences that can be generated by a general (non-linear) binary feedback shift register of length n, but not by a shorter one.A049538
Number of distinct binary sequences that can be generated by a general (non-linear) binary feedback shift register of length n, but not by a shorter one.
- Number of distinct binary sequences of length k+n generated by a general (non-linear) binary feedback shift register of length k, for sufficiently large k.A049539
Number of distinct binary sequences of length k+n generated by a general (non-linear) binary feedback shift register of length k, for sufficiently large k.
- Number of n-ominoes for a high-dimensional orthoplex.A049540
Number of n-ominoes for a high-dimensional orthoplex.
- Decimal expansion of 1/Pi.A049541
Decimal expansion of 1/Pi.
- Primes p such that x^10 = 2 has a solution mod p.A049542
Primes p such that x^10 = 2 has a solution mod p.
- Primes p such that x^11 = 2 has a solution mod p.A049543
Primes p such that x^11 = 2 has a solution mod p.
- Primes p such that x^12 = 2 has a solution mod p.A049544
Primes p such that x^12 = 2 has a solution mod p.
- Primes p such that x^13 = 2 has a solution mod p.A049545
Primes p such that x^13 = 2 has a solution mod p.
- Primes p such that x^14 = 2 has a solution mod p.A049546
Primes p such that x^14 = 2 has a solution mod p.
- Primes p such that x^15 = 2 has a solution mod p.A049547
Primes p such that x^15 = 2 has a solution mod p.
- a(n+1) = smallest number not containing any digits of a(n), working in base 4.A049548
a(n+1) = smallest number not containing any digits of a(n), working in base 4.
- Primes p such that x^17 = 2 has a solution mod p.A049549
Primes p such that x^17 = 2 has a solution mod p.
- Primes p such that x^18 = 2 has a solution mod p.A049550
Primes p such that x^18 = 2 has a solution mod p.
- Primes p such that x^19 = 2 has a solution mod p.A049551
Primes p such that x^19 = 2 has a solution mod p.
- Primes p such that x^20 = 2 has a solution mod p.A049552
Primes p such that x^20 = 2 has a solution mod p.
- Primes p such that x^21 = 2 has a solution mod p.A049553
Primes p such that x^21 = 2 has a solution mod p.
- Primes p such that x^22 = 2 has a solution mod p.A049554
Primes p such that x^22 = 2 has a solution mod p.
- Primes p such that x^23 = 2 has a solution mod p.A049555
Primes p such that x^23 = 2 has a solution mod p.
- Primes p such that x^24 = 2 has a solution mod p.A049556
Primes p such that x^24 = 2 has a solution mod p.
- Primes p such that x^25 = 2 has a solution mod p.A049557
Primes p such that x^25 = 2 has a solution mod p.
- Primes p such that x^26 = 2 has a solution mod p.A049558
Primes p such that x^26 = 2 has a solution mod p.
- a(n) = gcd(n - 1, phi(n)).A049559
a(n) = gcd(n - 1, phi(n)).
- Primes p such that x^28 = 2 has a solution mod p.A049560
Primes p such that x^28 = 2 has a solution mod p.