Sequences
392,541 sequences
- a(n) = n - floor( prime(n)/log(prime(n)) ).A064661
a(n) = n - floor( prime(n)/log(prime(n)) ).
- a(n) = n - round( prime(n)/log(prime(n)) ).A064662
a(n) = n - round( prime(n)/log(prime(n)) ).
- a(n) = n - ceiling( prime(n)/log(prime(n)) ).A064663
a(n) = n - ceiling( prime(n)/log(prime(n)) ).
- Regard A064413 as giving a permutation of the positive integers; sequence gives inverse permutation.A064664
Regard A064413 as giving a permutation of the positive integers; sequence gives inverse permutation.
- Regard A064413 as giving a permutation of the positive integers; sequence gives first infinite cycle, beginning at its smallest term, 7.A064665
Regard A064413 as giving a permutation of the positive integers; sequence gives first infinite cycle, beginning at its smallest term, 7.
- Regard A064413 as giving a permutation of the positive integers; sequence gives first infinite cycle, reading backwards beginning at its smallest term, 7.A064666
Regard A064413 as giving a permutation of the positive integers; sequence gives first infinite cycle, reading backwards beginning at its smallest term, 7.
- Regard A064413 as giving a permutation of the positive integers; sequence gives second infinite cycle, beginning at its smallest term, 73.A064667
Regard A064413 as giving a permutation of the positive integers; sequence gives second infinite cycle, beginning at its smallest term, 73.
- Regard A064413 as giving a permutation of the positive integers; sequence gives second infinite cycle, reading backwards beginning at its smallest term, 73.A064668
Regard A064413 as giving a permutation of the positive integers; sequence gives second infinite cycle, reading backwards beginning at its smallest term, 73.
- Regard A064413 as giving a permutation of the positive integers; sequence gives (presumed) smallest term in each cycle of this permutation.A064669
Regard A064413 as giving a permutation of the positive integers; sequence gives (presumed) smallest term in each cycle of this permutation.
- Triangle T(n,k) (1 <= k <= n) where the first column (T(n,1)) is the sequence of secant numbers A000364.A064670
Triangle T(n,k) (1 <= k <= n) where the first column (T(n,1)) is the sequence of secant numbers A000364.
- Number of n-digit base 4 biquanimous numbers (with leading 0's allowed, but not all-0 string).A064671
Number of n-digit base 4 biquanimous numbers (with leading 0's allowed, but not all-0 string).
- a(0) = 0, a(1) = 1; for a(n), n >= 2, write n = x^2 + y with y >= 0 as small as possible, then a(n) = a(x) + a(y).A064672
a(0) = 0, a(1) = 1; for a(n), n >= 2, write n = x^2 + y with y >= 0 as small as possible, then a(n) = a(x) + a(y).
- Where the least prime p such that n = (p-1)/(q-1) and p > q is not the least prime == 1 (mod n) (A034694).A064673
Where the least prime p such that n = (p-1)/(q-1) and p > q is not the least prime == 1 (mod n) (A034694).
- Number of primes q such that phiter(q)=n where phiter(n)=A064415(n).A064674
Number of primes q such that phiter(q)=n where phiter(n)=A064415(n).
- Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).A064675
Numbers k such that sopfr(k) = sopf(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).
- A Beatty sequence for 10*i^i.A064676
A Beatty sequence for 10*i^i.
- a(n) = sigma(n) - D(n) - pi(n), where D(n)=A001223, pi(n)= A000720.A064677
a(n) = sigma(n) - D(n) - pi(n), where D(n)=A001223, pi(n)= A000720.
- Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).A064678
Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).
- A Beatty sequence for 10*i^i.A064679
A Beatty sequence for 10*i^i.
- Halve every even number, double every odd number.A064680
Halve every even number, double every odd number.
- a(n) = number of partitions of n! into distinct parts.A064681
a(n) = number of partitions of n! into distinct parts.
- a(n) = number of partitions of n^n into distinct parts.A064682
a(n) = number of partitions of n^n into distinct parts.
- Let n(s) be the number formed from n by inserting s 0's between each digit, e.g. 123(2) is 1002003; sequence gives numbers n such that n(s) is divisible by n for some s>0.A064683
Let n(s) be the number formed from n by inserting s 0's between each digit, e.g. 123(2) is 1002003; sequence gives numbers n such that n(s) is divisible by n for some s>0.
- Number of primes in orbit of 2n+1 in the 3x+1 problem.A064684
Number of primes in orbit of 2n+1 in the 3x+1 problem.
- Length of orbit of 2n+1 in the 3x+1 problem.A064685
Length of orbit of 2n+1 in the 3x+1 problem.
- a(n) = number of n-digit base-3 biquams.A064686
a(n) = number of n-digit base-3 biquams.
- Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes.A064687
Numbers k such that 100k+1, 100k+3, 100k+7, 100k+9 are all primes.
- a(n) = number of partitions of primes into distinct (also odd) parts.A064688
a(n) = number of partitions of primes into distinct (also odd) parts.
- Smallest m such that A064672(m) = n.A064689
Smallest m such that A064672(m) = n.
- Define a sequence of fractions by x(m+1) = (x(m)^2+x(m)-1)/(x(m)+1) with x(0)=1; sequence gives values of k such that sgn(x(k))<>sgn(x(k-1)).A064690
Define a sequence of fractions by x(m+1) = (x(m)^2+x(m)-1)/(x(m)+1) with x(0)=1; sequence gives values of k such that sgn(x(k))<>sgn(x(k-1)).
- a(n) is the smallest number not already used such that a(n)*a(n-1)*a(n-2) + 1 is a square, with a(1)=1 and a(2)=2.A064691
a(n) is the smallest number not already used such that a(n)*a(n-1)*a(n-2) + 1 is a square, with a(1)=1 and a(2)=2.
- Total number of holes in decimal expansion of the number n, assuming 4 has 1 hole.A064692
Total number of holes in decimal expansion of the number n, assuming 4 has 1 hole.
- Number of connected components remaining when decimal expansion of the number n is cut from a piece of paper.A064693
Number of connected components remaining when decimal expansion of the number n is cut from a piece of paper.
- Add column entries of the table with rows (1,2,0,0...), (0,3,4,5,0,0...), (0,0,6,7,8,9,0,0...), (0,0,0,10,11,12,13,14,0,0...), ...A064694
Add column entries of the table with rows (1,2,0,0...), (0,3,4,5,0,0...), (0,0,6,7,8,9,0,0...), (0,0,0,10,11,12,13,14,0,0...), ...
- Complement of A064683.A064695
Complement of A064683.
- Smallest value of s>0 such that A064683(s) is divisible by n, or 0 if n belongs to A064695.A064696
Smallest value of s>0 such that A064683(s) is divisible by n, or 0 if n belongs to A064695.
- Numbers k such that A064696(k) = k-1.A064697
Numbers k such that A064696(k) = k-1.
- Number of values of s from 1 to n such that A064683(s) is divisible by s.A064698
Number of values of s from 1 to n such that A064683(s) is divisible by s.
- Integers for which the smallest m in A040076 such that n*2^m+1 is prime (A050921) increases.A064699
Integers for which the smallest m in A040076 such that n*2^m+1 is prime (A050921) increases.
- Numbers k that are divisible by the multiplicative digital root of k.A064700
Numbers k that are divisible by the multiplicative digital root of k.
- Duplicate of A035142.A064701
Duplicate of A035142.
- Nonnegative numbers such that additive and multiplicative digital roots coincide.A064702
Nonnegative numbers such that additive and multiplicative digital roots coincide.
- Smallest lucky number that is the product of n lucky numbers.A064703
Smallest lucky number that is the product of n lucky numbers.
- Numbers beginning and ending with their multiplicative digital root.A064704
Numbers beginning and ending with their multiplicative digital root.
- Maximal number of vectors u_1, u_2, ... in R^n with |u_i| = 1 and |u_i - u_j| >= 1 for i, j distinct, where || is L1-norm.A064705
Maximal number of vectors u_1, u_2, ... in R^n with |u_i| = 1 and |u_i - u_j| >= 1 for i, j distinct, where || is L1-norm.
- Square of permutation defined by A003188.A064706
Square of permutation defined by A003188.
- Inverse square of permutation defined by A003188.A064707
Inverse square of permutation defined by A003188.
- Initial term of run of (at least) n consecutive numbers with just 2 distinct prime factors.A064708
Initial term of run of (at least) n consecutive numbers with just 2 distinct prime factors.
- Initial term of run of (exactly) n consecutive numbers with just 2 distinct prime factors.A064709
Initial term of run of (exactly) n consecutive numbers with just 2 distinct prime factors.
- Numbers k such that the sum of divisors of k and the product of divisors of k are both perfect squares.A064710
Numbers k such that the sum of divisors of k and the product of divisors of k are both perfect squares.