Sequences
392,541 sequences
- Values of a certain hypergeometric function. Not known to be always integer-valued.A087661
Values of a certain hypergeometric function. Not known to be always integer-valued.
- Values of a certain hypergeometric function. Not known to be always integer-valued.A087662
Values of a certain hypergeometric function. Not known to be always integer-valued.
- Indices of records in A087666.A087663
Indices of records in A087666.
- Consider recurrence b(0) = n/4, b(k) = b(k-1)*floor(b(k-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.A087664
Consider recurrence b(0) = n/4, b(k) = b(k-1)*floor(b(k-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.
- Consider recurrence b(0) = n/4, b(k) = b(k-1)*floor(b(k-1)); sequence gives first integer reached, or -1 if no integer is ever reached.A087665
Consider recurrence b(0) = n/4, b(k) = b(k-1)*floor(b(k-1)); sequence gives first integer reached, or -1 if no integer is ever reached.
- Consider recurrence b(0) = n/3, b(k+1) = b(k)*floor(b(k)); a(n) is the least k such that b(k) is an integer, or -1 if no integer is ever reached.A087666
Consider recurrence b(0) = n/3, b(k+1) = b(k)*floor(b(k)); a(n) is the least k such that b(k) is an integer, or -1 if no integer is ever reached.
- Records in A087664.A087667
Records in A087664.
- Indices of records in A087664.A087668
Indices of records in A087664.
- The smallest index m such that b(m) is an integer, where b(0)=(2n+1)/n and b(k+1)=b(k)*floor(b(k)) for k>=0.A087669
The smallest index m such that b(m) is an integer, where b(0)=(2n+1)/n and b(k+1)=b(k)*floor(b(k)) for k>=0.
- The first integer in the sequence defined by b(0)=(2n+1)/n and b(k+1)=b(k)*floor(b(k)) for k>=0.A087670
The first integer in the sequence defined by b(0)=(2n+1)/n and b(k+1)=b(k)*floor(b(k)) for k>=0.
- Number of subsets S of {0,1,2,...,n-1} which are idempotent under squaring modulo n, where S*S mod n = {x*y mod n|x,y in S}.A087671
Number of subsets S of {0,1,2,...,n-1} which are idempotent under squaring modulo n, where S*S mod n = {x*y mod n|x,y in S}.
- n = k^2 - (reversal of k)^2 for two different values of k.A087672
n = k^2 - (reversal of k)^2 for two different values of k.
- a(n) is smallest number m such that (m = product of n primes, not necessarily distinct ones) and all divisors of m are lucky numbers.A087673
a(n) is smallest number m such that (m = product of n primes, not necessarily distinct ones) and all divisors of m are lucky numbers.
- Value of the n-th Eulerian polynomial (cf. A008292) evaluated at x=-2.A087674
Value of the n-th Eulerian polynomial (cf. A008292) evaluated at x=-2.
- Consider recurrence b(0) = (2n+1)/2, b(n) = b(0)*floor(b(n-1)); sequence gives first integer reached.A087675
Consider recurrence b(0) = (2n+1)/2, b(n) = b(0)*floor(b(n-1)); sequence gives first integer reached.
- Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.A087676
Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives number of steps to reach an integer, or -1 if no integer is ever reached.
- Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.A087677
Consider recurrence b(0) = n/3, b(n) = b(0)*floor(b(n-1)); sequence gives first integer reached, or -1 if no integer is ever reached.
- Numbers n such that n + 9 and n - 9 are both prime.A087678
Numbers n such that n + 9 and n - 9 are both prime.
- Numbers k such that both k+2 and k-2 are prime.A087679
Numbers k such that both k+2 and k-2 are prime.
- Numbers n such that n + 4 and n - 4 are both prime.A087680
Numbers n such that n + 4 and n - 4 are both prime.
- Numbers n such that n + 6 and n - 6 are both prime.A087681
Numbers n such that n + 6 and n - 6 are both prime.
- Numbers n such that n + 8 and n - 8 are both prime.A087682
Numbers n such that n + 8 and n - 8 are both prime.
- Numbers n such that n + 10 and n - 10 are both prime.A087683
Numbers n such that n + 10 and n - 10 are both prime.
- Consecutive repeating elements in sequence A006158.A087684
Consecutive repeating elements in sequence A006158.
- Primes p such that 5^p - 4^p is composite.A087685
Primes p such that 5^p - 4^p is composite.
- Elements of A004001 that repeat consecutively.A087686
Elements of A004001 that repeat consecutively.
- Number of solutions to x^2 + y^2 + z^2 == 0 (mod n).A087687
Number of solutions to x^2 + y^2 + z^2 == 0 (mod n).
- a(n) = number of solutions to x^3 - x == 0 (mod n).A087688
a(n) = number of solutions to x^3 - x == 0 (mod n).
- Numerators of successive partial sums of sum(1/(2^n-1)).A087689
Numerators of successive partial sums of sum(1/(2^n-1)).
- Denominators of successive partial sums of sum(1/(2^n-1)).A087690
Denominators of successive partial sums of sum(1/(2^n-1)).
- Squares of primes of the form 4*k+3.A087691
Squares of primes of the form 4*k+3.
- Number of cubes in multiplicative group modulo n.A087692
Number of cubes in multiplicative group modulo n.
- Lesser twin prime p such that 2^p-1 is composite.A087693
Lesser twin prime p such that 2^p-1 is composite.
- Number of solutions to x^2 + xy + y^2 == 0 (mod n).A087694
Number of solutions to x^2 + xy + y^2 == 0 (mod n).
- Numbers n such that n + 3 and n - 3 are both prime.A087695
Numbers n such that n + 3 and n - 3 are both prime.
- Numbers n such that n + 5 and n - 5 are both prime.A087696
Numbers n such that n + 5 and n - 5 are both prime.
- Numbers k such that k + 7 and k - 7 are both prime.A087697
Numbers k such that k + 7 and k - 7 are both prime.
- Triangle read by rows, giving T(n,k) = maximum number of examples (Boolean inputs) at Hamming distance 2 for symmetric Boolean functions that can have different outputs.A087698
Triangle read by rows, giving T(n,k) = maximum number of examples (Boolean inputs) at Hamming distance 2 for symmetric Boolean functions that can have different outputs.
- Greater twin prime p such that 2^p-1 is composite.A087699
Greater twin prime p such that 2^p-1 is composite.
- a(1) = 1, a(n) = smallest number such that the n-th partial concatenation has n divisors.A087700
a(1) = 1, a(n) = smallest number such that the n-th partial concatenation has n divisors.
- Maximal term in Collatz-iteration started at -1+2^n.A087701
Maximal term in Collatz-iteration started at -1+2^n.
- Triangular numbers arising in A088126.A087702
Triangular numbers arising in A088126.
- Primes whose digits can be partitioned (into at least two parts) into palindromes containing a palindromic part with at least two digits.A087703
Primes whose digits can be partitioned (into at least two parts) into palindromes containing a palindromic part with at least two digits.
- Number of steps for iteration of map x -> (5/3)*floor(x) to reach an integer > n when started at n, or -1 if no such integer is ever reached.A087704
Number of steps for iteration of map x -> (5/3)*floor(x) to reach an integer > n when started at n, or -1 if no such integer is ever reached.
- First integer > n reached under iteration of map x -> (5/3)*floor(x) when started at n, or -1 if no such integer is ever reached.A087705
First integer > n reached under iteration of map x -> (5/3)*floor(x) when started at n, or -1 if no such integer is ever reached.
- A087705/5.A087706
A087705/5.
- Number of steps for iteration of map x -> (5/3)*ceiling(x) to reach an integer > n when started at n, or -1 if no such integer is ever reached.A087707
Number of steps for iteration of map x -> (5/3)*ceiling(x) to reach an integer > n when started at n, or -1 if no such integer is ever reached.
- First integer > n reached under iteration of map x -> (5/3)*ceiling(x) when started at n, or -1 if no such integer is ever reached.A087708
First integer > n reached under iteration of map x -> (5/3)*ceiling(x) when started at n, or -1 if no such integer is ever reached.
- A087708/5.A087709
A087708/5.
- Least k >= 6 such that A087666(k) = n.A087710
Least k >= 6 such that A087666(k) = n.