Sequences
392,541 sequences
- Rebase n from 3 to 2. Replace 3^k with 2^k in ternary expansion of n.A065361
Rebase n from 3 to 2. Replace 3^k with 2^k in ternary expansion of n.
- Rebase n from 4 to 2. Replace 4^k with 2^k in quaternary expansion of n.A065362
Rebase n from 4 to 2. Replace 4^k with 2^k in quaternary expansion of n.
- Sum of balanced ternary digits in n. Replace 3^k with 1 in balanced ternary expansion of n.A065363
Sum of balanced ternary digits in n. Replace 3^k with 1 in balanced ternary expansion of n.
- Alternating sum of balanced ternary digits in n. Replace 3^k with (-1)^k in balanced ternary expansion of n.A065364
Alternating sum of balanced ternary digits in n. Replace 3^k with (-1)^k in balanced ternary expansion of n.
- Replace 3^k with 2^k in balanced ternary expansion of n.A065365
Replace 3^k with 2^k in balanced ternary expansion of n.
- Replace 3^k with (-2)^k in balanced ternary expansion of n.A065366
Replace 3^k with (-2)^k in balanced ternary expansion of n.
- Replace 3^k with (-3)^k in balanced ternary expansion of n.A065367
Replace 3^k with (-3)^k in balanced ternary expansion of n.
- Alternating sum of ternary digits in n. Replace 3^k with (-1)^k in ternary expansion of n.A065368
Alternating sum of ternary digits in n. Replace 3^k with (-1)^k in ternary expansion of n.
- Replace 3^k with (-3)^k in ternary expansion of n.A065369
Replace 3^k with (-3)^k in ternary expansion of n.
- The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to e = exp(1).A065370
The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to e = exp(1).
- a(1) = 1, a(prime(i)) = prime(i) - i for i > 0 and a(u * v) = a(u) * a(v) for u, v > 0.A065371
a(1) = 1, a(prime(i)) = prime(i) - i for i > 0 and a(u * v) = a(u) * a(v) for u, v > 0.
- a(n) = A065371(A065371(n)).A065372
a(n) = A065371(A065371(n)).
- Number of iterations of A065371 starting at n until 1 is reached.A065373
Number of iterations of A065371 starting at n until 1 is reached.
- Smallest k such that f(f(...f(k))) > 1, where f(k) = A065371(k) is iterated n times.A065374
Smallest k such that f(f(...f(k))) > 1, where f(k) = A065371(k) is iterated n times.
- The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to sqrt(2).A065375
The next smallest pair of numbers is taken so that a(2n-1)/a(2n) converges to sqrt(2).
- Primes of the form p + k^2, p prime and k > 0.A065376
Primes of the form p + k^2, p prime and k > 0.
- Primes not of the form p + k^2, with p prime and k > 0.A065377
Primes not of the form p + k^2, with p prime and k > 0.
- Primes p such that p^2 is a palindromic square.A065378
Primes p such that p^2 is a palindromic square.
- Palindromic squares with a prime root.A065379
Palindromic squares with a prime root.
- Primes of the form p + 2^k, p prime and k >= 0.A065380
Primes of the form p + 2^k, p prime and k >= 0.
- Primes not of the form p + 2^k, p prime and k >= 0.A065381
Primes not of the form p + 2^k, p prime and k >= 0.
- Number of primes between n(n+1)/2 (exclusive) and (n+1)(n+2)/2 (inclusive).A065382
Number of primes between n(n+1)/2 (exclusive) and (n+1)(n+2)/2 (inclusive).
- a(n) = smallest prime >= n*(n + 1)/2.A065383
a(n) = smallest prime >= n*(n + 1)/2.
- Largest prime <= n * (n + 1) / 2.A065384
Largest prime <= n * (n + 1) / 2.
- Numbers m at which value of cototient function (A051953) reaches a new record: cototient(m) > cototient(k) for all k < m.A065385
Numbers m at which value of cototient function (A051953) reaches a new record: cototient(m) > cototient(k) for all k < m.
- Successive record values of the cototient function (A051953).A065386
Successive record values of the cototient function (A051953).
- a(n) = sigma(n) + phi(n).A065387
a(n) = sigma(n) + phi(n).
- Record values for sigma(m) + phi(m): sum of sigma and totient is larger than for any previous number.A065388
Record values for sigma(m) + phi(m): sum of sigma and totient is larger than for any previous number.
- Numbers m such that sigma(phi(m)) sets a new record, i.e., sigma(phi(m)) > sigma(phi(k)) for all k < m numbers.A065389
Numbers m such that sigma(phi(m)) sets a new record, i.e., sigma(phi(m)) > sigma(phi(k)) for all k < m numbers.
- Peak values reached by A062402 at the sites listed in A065389.A065390
Peak values reached by A062402 at the sites listed in A065389.
- Numbers m such that A062401(m) = phi(sigma(m)) is increasing to a record value, i.e., A062401(m) represents a new peak, so that A062401(m) > A062401(k) for all k < m.A065391
Numbers m such that A062401(m) = phi(sigma(m)) is increasing to a record value, i.e., A062401(m) represents a new peak, so that A062401(m) > A062401(k) for all k < m.
- a(n) = A062401(A065391(n)): phi(sigma(m)) peak values for numbers m (listed in A065391) at which those peaks are first reached.A065392
a(n) = A062401(A065391(n)): phi(sigma(m)) peak values for numbers m (listed in A065391) at which those peaks are first reached.
- Sigma(phi(m)) - phi(sigma(m)) is increasing at these values of m.A065393
Sigma(phi(m)) - phi(sigma(m)) is increasing at these values of m.
- Increasing values of A065395: a(n) = A065395(A065393(n)).A065394
Increasing values of A065395: a(n) = A065395(A065393(n)).
- Commutator of sigma and phi functions.A065395
Commutator of sigma and phi functions.
- Primes of the form p + k*(k+1) / 2, p prime and k > 0.A065396
Primes of the form p + k*(k+1) / 2, p prime and k > 0.
- Primes which have no representation p + k*(k+1) / 2, with p prime and k > 0: A000040-Complement of A065396.A065397
Primes which have no representation p + k*(k+1) / 2, with p prime and k > 0: A000040-Complement of A065396.
- Fibonacci numbers whose digits sum to a prime.A065398
Fibonacci numbers whose digits sum to a prime.
- a(n) is the greatest integer m such that (1) written in base n it is also readable as if it is in factorial base and (2) this factorial base value is smaller than or equal to m.A065399
a(n) is the greatest integer m such that (1) written in base n it is also readable as if it is in factorial base and (2) this factorial base value is smaller than or equal to m.
- a(n) is the greatest integer m such that (1) written in factorial base it is also readable as if it is in base n and (2) this base-n value is greater than or equal to m.A065400
a(n) is the greatest integer m such that (1) written in factorial base it is also readable as if it is in base n and (2) this base-n value is greater than or equal to m.
- Number of normal play partisan games born on or before day n.A065401
Number of normal play partisan games born on or before day n.
- Number of normal play partisan games born on day n.A065402
Number of normal play partisan games born on day n.
- Primes of the form sigma(m^2) where m is a composite number ordered by values m.A065403
Primes of the form sigma(m^2) where m is a composite number ordered by values m.
- Squares of composite numbers k such that sigma(k) (sum of divisors of k, A000203) is a prime.A065404
Squares of composite numbers k such that sigma(k) (sum of divisors of k, A000203) is a prime.
- Composite numbers k such that the sum of the divisors of k^2 is a prime.A065405
Composite numbers k such that the sum of the divisors of k^2 is a prime.
- Mersenne prime exponents (A000043) which are also Sophie Germain primes (A005384).A065406
Mersenne prime exponents (A000043) which are also Sophie Germain primes (A005384).
- Number of levels in lattice formed by normal play partisan games born on day n.A065407
Number of levels in lattice formed by normal play partisan games born on day n.
- Squares whose digits sum to a prime.A065408
Squares whose digits sum to a prime.
- Fennessey-Larcombe-French sequence.A065409
Fennessey-Larcombe-French sequence.
- Number of labeled, rooted, binary trees with internal nodes labeled from {1, ...,n} and leaves labeled from {0,1} such that for any path from the root to a leaf, the internal nodes receive distinct labels. In other words, the number of decision trees on n Boolean variables.A065410
Number of labeled, rooted, binary trees with internal nodes labeled from {1, ...,n} and leaves labeled from {0,1} such that for any path from the root to a leaf, the internal nodes receive distinct labels. In other words, the number of decision trees on n Boolean variables.