daedalus / MyOEIS

My OEIS published integer sequences

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

My OEIS published integer sequences

  1. A352881 SeqDB a(n) is the minimal number z having the largest number of solutions to the Diophantine equation 1/z = 1/x + 1/y such that 1 <= x <= y <= 10^n.

  2. A347105 SeqDB a(n) is the greatest sum of the digital roots of the individual factorizations of n.

  3. A355069 SeqDB a(n) is the number of solutions to x^y == y^x (mod p) where 0 < x,y <= p^2 - p and p is the n-th prime.

  4. A355419 SeqDB a(n) is the number of solutions to x^y == y^x (mod p) where 0 < x,y <= p and p is the n-th prime.

  5. A355486 SeqDB a(n) is the number of total solutions (minus the n-th prime) to x^y == y^x (mod p) where 0 < x,y <= p and p is the n-th prime.

  6. A357945 SeqDB Numbers k which are not square but D = (b+c)^2 - k is square, where b = floor(sqrt(k)) and c = k - b^2.

  7. A358016 SeqDB For n >= 3, a(n) is the largest k <= n-2 such that k^2 == 1 (mod n).

  8. A357928 SeqDB a(n) is the smallest c for which (s+c)^2-n is a square, where s = floor(sqrt(n)), or -1 if no such c exists.

  9. A358043 SeqDB Numbers k such that phi(k) is a multiple of 8.

  10. A358051 SeqDB Squares k such that phi(k) is a cube.

  11. A359415 SeqDB Numbers k such that phi(k) is a 5-smooth number where phi is the Euler totient function.

  12. A359864 SeqDB a(n) is the number of solutions to the congruence x^y == y^x (mod n) where 0 <= x,y <= n.

  13. A358821 SeqDB a(n) is the largest square dividing n^2-1.

  14. A360760 SeqDB a(n) = n^16 + n^15 + n^2 + 1 (or crc-16-ibm poly).

  15. A361913 SeqDB a(n) is the number of steps in the main loop of the Pollard's rho integer factorization algorithm with x=2, y=2 and g(x)=x^2-1.

  16. A362008 SeqDB Numbers whose Euler's cototient is divisible by 9.

  17. A362961 SeqDB a(n) = Sum_{b=0..floor(sqrt(n)), n-b^2 is square} b.

  18. A363051 SeqDB a(n) = Sum_{b=0..floor(sqrt(n/2)), n-b^2 is square} b.

  19. A362502 SeqDB Least k > 0 such that (floor(sqrt(n*k)) + 1)^2 mod n is a square.

  20. A363612 SeqDB Number of iterations of phi(x) at n needed to reach a square.

  21. A363680 SeqDB Number of iterations of phi(x) at n needed to reach a cube.

  22. A363896 SeqDB Numbers k such that the sum of primes dividing k (with repetition) is equal to Euler's totient function of k.

  23. A363895 SeqDB Floor of the average of the distinct prime factors of n.

  24. A362951 SeqDB a(n) is the Hamming distance between the binary expansions of n and phi(n) where phi is the Euler totient function (A000010).

  25. A364143 SeqDB a(n) is the minimal number of consecutive squares needed to sum to A216446(n)

  26. A364168 SeqDB Numbers that can be written in more than one way in the form (j+2k)^2-(j+k)^2-j^2 with j,k>0.

  27. A364834 SeqDB Sum of positive integers <= n which are multiples of 2 or 5.

  28. A359198 SeqDB Numbers k such that 2*phi(k)-k is a prime, where phi is A000010.

  29. A363583 SeqDB Numbers k such that 2*phi(k)+k is a prime, where phi is A000010.

  30. A365074 SeqDB Numbers k such that k! - k^2 - 1 is prime.

  31. A365617 SeqDB Iterated Pochhammer symbol.

  32. A365628 SeqDB a(n) = binomial(primorial(n), n).

  33. A365749 SeqDB Number of iterations that produce a record high of the digest of the SHA2-256 hash of the empty string.

  34. A366061 SeqDB Numbers of iterations that produce a record low of the digest of the SHA2-256 hash of the empty string.

  35. A365639 SeqDB Numbers k such that k! + k^3 + 1 is prime.

  36. A365686 SeqDB Numbers k such that there exists a pair of integers (m,h) where 1 <= m < floor(sqrt(k)/2) <= h that satisfy Sum_{j=0..m} (k-j)^2 = Sum_{i=1..m} (h+i)^2.

  37. A366160 SeqDB Numbers whose binary expansion is not quasiperiodic.

  38. A364535 SeqDB a(n) is the number of subsets of the first n primes whose sum is not a prime.

  39. A367690 SeqDB Total number of steps of Euclid's GCD algorithm to calculate gcd(x,y) for all pairs x,y in the range 1 <= x,y <= n.

  40. A367892 SeqDB Total number of steps of Euclid's GCD algorithm to calculate gcd(x,y) for all pairs x,y in the range 1 <= y <= x <= n.

About

My OEIS published integer sequences