https://github.com/daedalus/myoeis

My OEIS published integer sequences
https://github.com/daedalus/myoeis

integer oeis sequence

Last synced: 6 months ago
JSON representation

My OEIS published integer sequences

• Host: GitHub
• URL: https://github.com/daedalus/myoeis
• Owner: daedalus
• Created: 2022-09-10T04:09:00.000Z (almost 4 years ago)
• Default Branch: main
• Last Pushed: 2025-03-12T19:09:09.000Z (over 1 year ago)
• Last Synced: 2025-03-12T20:22:39.470Z (over 1 year ago)
• Topics: integer, oeis, sequence
• Homepage:
• Size: 244 KB
• Stars: 1
• Watchers: 2
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

          
## My [OEIS](https://oeis.org) published integer sequences ##

1. [A352881](https://oeis.org/A352881)	[SeqDB](https://sequencedb.net/s/A352881) 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](https://oeis.org/A347105)	[SeqDB](https://sequencedb.net/s/A347105) a(n) is the greatest sum of the digital roots of the individual factorizations of n.

3. [A355069](https://oeis.org/A355069)	[SeqDB](https://sequencedb.net/s/A355069) 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](https://oeis.org/A355419)	[SeqDB](https://sequencedb.net/s/A355419) 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](https://oeis.org/A355486)	[SeqDB](https://sequencedb.net/s/A355486) 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](https://oeis.org/A357945)	[SeqDB](https://sequencedb.net/s/A357945) 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](https://oeis.org/A358016)	[SeqDB](https://sequencedb.net/s/A358016) For n >= 3, a(n) is the largest k <= n-2 such that k^2 == 1 (mod n).

8. [A357928](https://oeis.org/A357928)	[SeqDB](https://sequencedb.net/s/A357928) 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](https://oeis.org/A358043)	[SeqDB](https://sequencedb.net/s/A358043) Numbers k such that phi(k) is a multiple of 8.

10. [A358051](https://oeis.org/A358051)	[SeqDB](https://sequencedb.net/s/A358051) Squares k such that phi(k) is a cube.

11. [A359415](https://oeis.org/A359415)	[SeqDB](https://sequencedb.net/s/A359415) Numbers k such that phi(k) is a 5-smooth number where phi is the Euler totient function.

12. [A359864](https://oeis.org/A359864)	[SeqDB](https://sequencedb.net/s/A359864) a(n) is the number of solutions to the congruence x^y == y^x (mod n) where 0 <= x,y <= n.

13. [A358821](https://oeis.org/A358821)	[SeqDB](https://sequencedb.net/s/A358821) a(n) is the largest square dividing n^2-1.

14. [A360760](https://oeis.org/A360760)	[SeqDB](https://sequencedb.net/s/A360760) a(n) = n^16 + n^15 + n^2 + 1 (or crc-16-ibm poly).

15. [A361913](https://oeis.org/A361913)	[SeqDB](https://sequencedb.net/s/A361913) 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](https://oeis.org/A362008)	[SeqDB](https://sequencedb.net/s/A362008) Numbers whose Euler's cototient is divisible by 9.

17. [A362961](https://oeis.org/A362961)	[SeqDB](https://sequencedb.net/s/A362961) a(n) = Sum_{b=0..floor(sqrt(n)), n-b^2 is square} b. [Graph](https://oeis.org/A362961/graph).

18. [A363051](https://oeis.org/A363051)	[SeqDB](https://sequencedb.net/s/A363051) a(n) = Sum_{b=0..floor(sqrt(n/2)), n-b^2 is square} b.

19. [A362502](https://oeis.org/A362502)	[SeqDB](https://sequencedb.net/s/A362502)	Least k > 0 such that (floor(sqrt(n*k)) + 1)^2 mod n is a square. [Graph](https://oeis.org/A362502/graph).

20. [A363612](https://oeis.org/A363612) [SeqDB](https://sequencedb.net/s/A363612)	Number of iterations of phi(x) at n needed to reach a square.

21. [A363680](https://oeis.org/A363680)	[SeqDB](https://sequencedb.net/s/A363680)	Number of iterations of phi(x) at n needed to reach a cube.

22. [A363896](https://oeis.org/A363896)	[SeqDB](https://sequencedb.net/s/A363896)	Numbers k such that the sum of primes dividing k (with repetition) is equal to Euler's totient function of k.

23. [A363895](https://oeis.org/A363895)	[SeqDB](https://sequencedb.net/s/A363895)	Floor of the average of the distinct prime factors of n.

24. [A362951](https://oeis.org/A362951)	[SeqDB](https://sequencedb.net/s/A362951)	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](https://oeis.org/A364143)	[SeqDB](https://sequencedb.net/s/A364143) a(n) is the minimal number of consecutive squares needed to sum to A216446(n)

26. [A364168](https://oeis.org/A364168)	[SeqDB](https://sequencedb.net/s/A364168) 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](https://oeis.org/A364834) [SeqDB](https://sequencedb.net/s/A364834)	Sum of positive integers <= n which are multiples of 2 or 5.

28. [A359198](https://oeis.org/A359198) [SeqDB](https://sequencedb.net/s/A359198)	Numbers k such that 2*phi(k)-k is a prime, where phi is A000010.

29. [A363583](https://oeis.org/A363583) [SeqDB](https://sequencedb.net/s/A363583)	Numbers k such that 2*phi(k)+k is a prime, where phi is A000010.

30. [A365074](https://oeis.org/A365074) [SeqDB](https://sequencedb.net/s/A365074)	Numbers k such that k! - k^2 - 1 is prime.

31. [A365617](https://oeis.org/A365617) [SeqDB](https://sequencedb.net/s/A365617)	Iterated Pochhammer symbol.

32. [A365628](https://oeis.org/A365628) [SeqDB](https://sequencedb.net/s/A365628) a(n) = binomial(primorial(n), n).

33. [A365749](https://oeis.org/A365749) [SeqDB](https://sequencedb.net/s/A365749) Number of iterations that produce a record high of the digest of the SHA2-256 hash of the empty string.

34. [A366061](https://oeis.org/A366061) [SeqDB](https://sequencedb.net/s/A366061)	Numbers of iterations that produce a record low of the digest of the SHA2-256 hash of the empty string.

35. [A365639](https://oeis.org/A365639) [SeqDB](https://sequencedb.net/s/A365639)	Numbers k such that k! + k^3 + 1 is prime.

36. [A365686](https://oeis.org/A365686) [SeqDB](https://sequencedb.net/s/A365686)	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](https://oeis.org/A366160) [SeqDB](https://sequencedb.net/s/A366160)	Numbers whose binary expansion is not quasiperiodic.

38. [A364535](https://oeis.org/A364535) [SeqDB](https://sequencedb.net/s/A364535)	a(n) is the number of subsets of the first n primes whose sum is not a prime.

39. [A367690](https://oeis.org/A367690) [SeqDB](https://sequencedb.net/s/A367690)	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](https://oeis.org/A367892) [SeqDB](https://sequencedb.net/s/A367892)	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. [Grah](https://oeis.org/A367892/graph).

41. [A367379](https://oeis.org/A367379) [SeqDB](https://sequencedb.net/s/A367379)	a(n) = Sum_{j=1..n} Sum_{i=1..n} (j mod i). [Graph](https://oeis.org/A367379/graph).

42. [A368275](https://oeis.org/A368275)	[SeqDB](https://sequencedb.net/s/A368275)	Fibonacci zig-zag function.

43. [A367954](https://oeis.org/A367954) [SeqDB](https://sequencedb.net/s/A367954) 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.

44. [A369802](https://oeis.org/A369802) [SeqDB](https://sequencedb.net/s/A369802) Inversion count of the Eytzinger array layout of n elements.

45. [A369920](https://oeis.org/A369920) [SeqDB](https://sequencedb.net/s/A369920) The private keys for the 32 BTC Bitcoin puzzle.

46. [A370006](https://oeis.org/A370006) [SeqDB](https://sequencedb.net/s/A370006)	Steinhaus-Johnson-Trotter rank of the Eytzinger array layout of n elements.

47. [A368783](https://oeis.org/A368783) [SeqDB](https://sequencedb.net/s/A368783)	Lexicographic rank of the permutation which is the Eytzinger array layout of n elements.

48. [A369922](https://oeis.org/A369922) [SeqDB](https://sequencedb.net/s/A369922) a(n) = 8*n^3 - 6*n - 1.

49. [A370879](https://oeis.org/A370879) [SeqDB](https://sequencedb.net/s/A370879) a(n) = 2^n*t + 1 where t is the least x such that there exists an r in the range 2 <= r <= x+1 that is coprime to 2^n*x + 1 and has multiplicative order 2^n modulo 2^n*x + 1.

50. [A371124](https://oeis.org/A371124) [SeqDB](https://sequencedb.net/s/A371124) a(n) is the least nonnegative integer y such that y^2 = x^2 - k*n for k and x where n > k >= 1 and n > x >= floor(sqrt(n)).

51. [A371531](https://oeis.org/A371531) [SeqDB](https://sequencedb.net/s/A371531) a(n) is the multiplicative order of A053669(n) modulo n.

52. [A372305](https://oeis.org/A372305) [SeqDB](https://sequencedb.net/s/A372305) a(n) = Product_{k=2..n-1} MultiplicativeOrder(k,n) where gcd(k,n)=1.

53. [A372651](https://oeis.org/A372651) [SeqDB](https://sequencedb.net/s/A372651)	a(n) is the product of the distinct nonzero quadratic residues of n.

54. [A373286](https://oeis.org/A373286) [SeqDB](https://sequencedb.net/s/A373286) a(n) = Product_{k=1..n} (k^2 mod n if k^2 mod n > 0).

55. [A373194](https://oeis.org/A373194) [SeqDB](https://sequencedb.net/s/A373194) Numbers k such that phi(k) is a Lucas number.

56. [A373461](https://oeis.org/A373461)	[SeqDB](https://sequencedb.net/s/A373461) a(n) = s - t where s = ceiling(sqrt(n*i)), t = sqrt(m), and m = s^2 mod n, for the smallest positive integer i for which m is square.

57. [A373879](https://oeis.org/A373879) [SeqDB](https://sequencedb.net/s/A373879) Composite numbers not factorizable using the Pollard-rho algorithm with parameters x=2,y=2 and f(x)=x^2-1.

58. [A373716](https://oeis.org/A373716) [SeqDB](https://sequencedb.net/s/A373716) a(n) is the number of distinct products i*j minus the number of distinct sums i+j with 1 <= i, j <= n.

59. [A373652](https://oeis.org/A373652) [SeqDB](https://sequencedb.net/s/A373652) Composite numbers k for which g = gcd(f(i*c), k) = 1 or k for all i in the range 1 <= i <= c, where f(x) = Product_{j=1..c} x+j and c = floor(k^(1/4)).

60. [A374625](https://oeis.org/A374625) [SeqDB](https://sequencedb.net/s/A374625) In the binary expansion of n, expand bits 1 -> 01 and 0 -> 10. [Graph](https://oeis.org/A374625/graph).

61. [A374510](https://oeis.org/A374510) [SeqDB](https://sequencedb.net/s/A374510) Sum of those numbers t which have a unique representation as the sum of floor(n/2) distinct squares from among 1^2,...,n^2.

62. [A374730](https://oeis.org/A374730) [SeqDB](https://sequencedb.net/s/A374730) a(n) = n * binomial(floor(log_2(n)) + 1, 2).

63. [A374720](https://oeis.org/A374720) [SeqDB](https://sequencedb.net/s/A374720) Permutation rank of the initial state S of length n in an RC4-like Key Scheduling Algorithm with key comprising numbers 1 to n.

64. [A375156](https://oeis.org/A375156) [SeqDB](https://sequencedb.net/s/A375156) In the binary expansion of n: expand bits 1 -> 01 and 0 -> x0 from most to least significant, where x is the complement of the previous bit from n.

65. [A375109](https://oeis.org/A375109) [SeqDB](https://sequencedb.net/s/A375109) Number of distinct products i*j with 1 <= i, j <= n which are not the sum of two numbers between 1 and n.

66. [A374967](https://oeis.org/A374967) [SeqDB](https://sequencedb.net/s/A374967) a(n) is the Verhoeff check digit of n.

67. [A375585](https://oeis.org/A375585) [SeqDB](https://sequencedb.net/s/A375585) Number of ASCII letter 'A' bytes that when compressed with zlib generate a new record longest compressed byte stream.

68. [A375649](https://oeis.org/A375649) [SeqDB](https://sequencedb.net/s/A375649) Number of comparisons and swaps in the Batcher odd-even merge sort needed to sort n items.

69. [A375764](https://oeis.org/A375764) [SeqDB](https://sequencedb.net/s/A375764) a(n) is the sum of distinct sums of all subsets with two or more elements of {1, 2, ..., n}. [Graph](https://oeis.org/A375764/graph).

70. [A375825](https://oeis.org/A375825) [SeqDB](https://sequencedb.net/s/A375825) Triangle read by rows where row n is the Eytzinger array layout of n elements (a permutation of {1..n}).

71. [A375745](https://oeis.org/A375745) [SeqDB](https://sequencedb.net/s/A375745) a(n) is the sum of the vector of the reduced discriminant of the n-th cyclotomic polynomial.

72. [A375789](https://oeis.org/A375789) [SeqDB](https://sequencedb.net/s/A375789) First position index for A197123(n) in the decimal expansion of Pi.

73. [A374849](https://oeis.org/A374849) [SeqDB](https://sequencedb.net/s/A374849) In the binary expansion of n: Collapse bits from most to least significant 10 -> 1, 01 -> 0, 00 -> nothing, 11 -> nothing. [Graph](https://oeis.org/A374849/graph)

74. [A375959](https://oeis.org/A375959) [SeqDB](https://sequencedb.net/s/A375959) Partial products of A006257.

75. [A376295](https://oeis.org/A376295) [SeqDB](https://sequencedb.net/s/A376295) The binary expansion of a(n) is the reversal of the concatenation of the binary expansions of 1,...,n.

76. [A376299](https://oeis.org/A376299) [SeqDB](https://sequencedb.net/s/A376299) Fixed points of A008473.

77. [A376951](https://oeis.org/A376951) [SeqDB](https://sequencedb.net/s/A376951) Characteristic polynomial of the Pappus graph: a(n) = (n-3)*n^4*(n+3)*(n^2-3)^6. [Graph](https://oeis.org/A376951/graph).

78. [A377059](https://oeis.org/A377059) [SeqDB](https://sequencedb.net/s/A377059) a(n) is the smallest even r less than n-1 such that x^r = 1 (mod n) for the least x such that gcd(x,n)=1 for n >= 4 else 0. [Graph](https://oeis.org/A377059/graph).

79. [A377029](https://oeis.org/A377029) [SeqDB](https://sequencedb.net/s/A377029) a(1) = 0; therafter in the binary expansion of a(n-1), expand bits: 1->01 and 0->10.

80. [A376613](https://oeis.org/A376613) [SeqDB](https://sequencedb.net/s/A376613) The binary expansion of a(n) tracks where the merge operations occurs in a Tim sort algorithm applied to n blocks.

81. [A377704](https://oeis.org/A377704) [SeqDB](https://sequencedb.net/s/A377704) a(n) = binomial(Fibonacci(n)+Fibonacci(n+1)-2,Fibonacci(n)-1).

82. [A378298](https://oeis.org/A378298) [SeqDB](https://sequencedb.net/s/A378298) Number of solutions that satisfy the congruence: i^2 == j^2 (mod n) with 1 <= i < j <= n. [Graph](https://oeis.org/A378298/graph).

83. [A378488](https://oeis.org/A378488) [SeqDB](https://sequencedb.net/s/A378488) Table T(n,k) read by rows where in the n-th row the k-th column is the permutation rank of the k-th solution to the n-queens problem in a n X n board.

84. [A378299](https://oeis.org/A378299) [SeqDB](https://sequencedb.net/s/A378299) Read the binary representation of n from the most to least significant bit then perform a cumulative XOR and store by reading from least to most significant bit. [Graph](https://oeis.org/A378299/graph).

85. [A379040](https://oeis.org/A379040) [SeqDB](https://sequencedb.net/s/A379040) Fixed points in A379015.

86. [A379015](https://oeis.org/A379015) [SeqDB](https://sequencedb.net/s/A379015) a(n) is the reversed non-adjacent form (NAF) representation of n. [Graph](https://oeis.org/A379015/graph).

87. [A379578](https://oeis.org/A379578) [SeqDB](https://sequencedb.net/s/A379578) In the base-4 expansion of n map 0->1, 1->3, 2->0, 3->2.  [Graph](https://oeis.org/A379578/graph).

88. [A377292](https://oeis.org/A377292) [SeqDB](https://sequencedb.net/s/A377292) Terms of A118666 as produced by the program given there (without the final sorting).

89. [A379604](https://oeis.org/A379604) [SeqDB](https://sequencedb.net/s/A379604) a(n) is the maximum number of items in a bucket for the bucket sort algorithm with input {0, 1, ..., n-1} and B = floor(sqrt(n)) buckets.

90. [A379865](https://oeis.org/A379865) [SeqDB](https://sequencedb.net/s/A379865) Number of base 10 digits of A060286.

91. [A379863](https://oeis.org/A379863) [SeqDB](https://sequencedb.net/s/A379863) a(n) is the number of steps in a Pollard rho like integer factorization algorithm for m = 2*n + 1 with f(x) = 2^x mod m and starting from x = y = 1.

92. [A379740](https://oeis.org/A379740) [SeqDB](https://sequencedb.net/s/A379740) Number of calls to Karatsuba's multiplication algorithm K(x,y) when recursively calculating K(Fibonacci(n),Fibonacci(n+1)) in decimal digits.

93. [A379905](https://oeis.org/A379905) [SeqDB](https://sequencedb.net/s/A379905) Rank of the permutation resulting from a pre-order traversal of a binary tree which is complete except for the final row and has vertices numbered 0 to n-1.

94. [A377475](https://oeis.org/A377475) [SeqDB](https://sequencedb.net/s/A377475) a(n) is the Even-Rodeh encoding of n as an integer.

95. [A380149](https://oeis.org/A380149) [SeqDB](https://sequencedb.net/s/A380149) Characteristic polynomial of the tesseract graph: a(n) = n^6*(n^2-16)*(n^2-4)^4.

96. [A380207](https://oeis.org/A380207) [SeqDB](https://sequencedb.net/s/A380207) Rank of the partition of n formed by the terms of its binary expansion from largest to smallest

97. [A380294](https://oeis.org/A380294) [SeqDB](https://sequencedb.net/s/A380294) The Golomb-Rice encoding of n, with M = A070939(A070939(n)).

98. [A380145](https://oeis.org/A380145) [SeqDB](https://sequencedb.net/s/A380145) The binary expansion of a(n) is an initial 1 bit then tracks where the swaps occur in the exchange sort algorithm sorting the binary expansion of n into decreasing order.

99. [A380790](https://oeis.org/A380790) [SeqDB](https://sequencedb.net/s/A380790) Length of the n-th Golomb ruler constructed by the Paul Erdős and Pál Turán formula.

100. [A380856](https://oeis.org/A380856) [SeqDB](https://sequencedb.net/s/A380856) In the binary expansion of n, arrange bits row-wise in a binary tree which is complete except for the last row and then read those bits in pre-order. [Graph](https://oeis.org/A380856/graph).

101. [A380110](https://oeis.org/A380110) [SeqDB](https://sequencedb.net/s/A380110) In the base 4 expansion of n: map 0->0, 1->1, 2->1, 3->2.  [Graph](https://oeis.org/A380110/graph).

102. [A381056](https://oeis.org/A381056) [SeqDB](https://sequencedb.net/s/A381056) Product of row n of A329708.

103. [A381503](https://oeis.org/A381503) [SeqDB](https://sequencedb.net/s/A381503) Number of rectangles in a Fibonacci(n) X Fibonacci(n+1) grid.

104. [A381457](https://oeis.org/A381457) [SeqDB](https://sequencedb.net/s/A381457) Integers encoding the recursive structure of a bitonic sorter network of n elements in their binary expansion.

105. [A382221](https://oeis.org/A382221) [SeqDB](https://sequencedb.net/s/A382221) Products of primitive roots when n is 2, 4, p^k, or 2p^k (with p an odd prime), for all other n the value is defined to be 1.

106. [A380934](https://oeis.org/A380934) [SeqDB](https://sequencedb.net/s/A380934) Elias delta encoding of n converted from base 2 to integer.

107. [A375584](https://oeis.org/A375584) [SeqDB](https://sequencedb.net/s/A375584) a(n) = digit produced when the Michael Damm error-detecting algorithm is applied to n.

108. [A358489](https://oeis.org/A358489) [SeqDB](https://sequencedb.net/s/A358489) Numbers k such that phi(k) = 13! where phi is the Euler totient function (A000010).

109. [A383270](https://oeis.org/A383270) [SeqDB](https://sequencedb.net/s/A383270) Length of the longest sequence of contiguous 1s in the binary expansion of n after flipping at most one 0-bit to 1.

110. [A383252](https://oeis.org/A383252) [SeqDB](https://sequencedb.net/s/A383252) Numbers that cannot be written in the form (j+2k)^2-(j+k)^2-j^2 with j,k>0.

111. [A383738](https://oeis.org/A383738) [SeqDB](https://sequencedb.net/s/A383738) Number of solutions to the n-queens puzzle in a n X n board that are not square root permutations of {n-1,...,2,1,0}.

112. [A383835](https://oeis.org/A383835) [SeqDB](https://sequencedb.net/s/A383835) Number of permutations of [n] whose compositional square is the identity permutation or its reverse.

113. [A383909](https://oeis.org/A383909) [SeqDB](https://sequencedb.net/s/A383909) In the base 4 expansion of n, map: 0 -> 20, 1 -> 21, 2 -> 30, 3 -> 31. [Graph](https://oeis.org/A383909/graph).

114. [A383976](https://oeis.org/A383976) [SeqDB](https://sequencedb.net/s/A383976) In the binary expansion of n, expand bits 1 -> 11 and 0 -> 10. [Graph](https://oeis.org/A383976/graph).

115. [A384330](https://oeis.org/A384330) [SeqDB](https://sequencedb.net/s/A384330) Number of distinct subsets S of [n] such that for all 1 <= k <= n, there exist elements x,y in S (not necessarily distinct) such that x*y = 2k.

116. [A383036](https://oeis.org/A383036) [SeqDB](https://sequencedb.net/s/A383036) The determinant of the matrix representing a totally anti-symmetric quasigroup of order 2*n+1.

117. [A384197](https://oeis.org/A384197) [SeqDB](https://sequencedb.net/s/A384197) The Barret reducer reciprocal mod n.

118. [A382454](https://oeis.org/A382454) [SeqDB](https://sequencedb.net/s/A382454) Number of solutions winning the Tchoukaillon game with n seeds and 2n pits.

119. [A383752](https://oeis.org/A382454) [SeqDB](https://sequencedb.net/s/A382454) Product of nonzero remainders n mod p, over all primes p < n.

120. [A384452](https://oeis.org/A384452) [SeqDB](https://sequencedb.net/s/A384452) a(n) is the sum of squares of the unitary divisors of n!.

121. [A384543](https://oeis.org/A384543) [SeqDB](https://sequencedb.net/s/A384543) Number of distinct values from the bitwise operation i XOR j for all integers i and j in the range [1, n].

122. [A384666](https://oeis.org/A384666) [SeqDB](https://sequencedb.net/s/A384666) Number of distinct values of the quadratic discriminant D=b^2-4*a*c, for a,b,c in the range [-n,n].

123. [A384763](https://oeis.org/A384763) [SeqDB](https://sequencedb.net/s/A384763) Product of the Euler totients of the unitary divisors of n.

124. [A384716](https://oeis.org/A384716) [SeqDB](https://sequencedb.net/s/A384716) The totient of the product of unitary divisors of n.

125. [A385029](https://oeis.org/A385029) [SeqDB](https://sequencedb.net/s/A385029) a(n) = Sum_{-n <= a, b, c <= n} (b^2 - 4*a*c).