text: The OEIS is supported by the many generous donors to the OEIS Foundation.
  
   Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
   A360078 Moebius function for the floor quotient poset. 2
   1, -1, -1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, -1, -1, -1, -1, -1, -1, 0, 0, 0, -1, -1, -1, -2, -2, -2, -2, -2, -2, -1, -1, -1, -1, 0, 0, -1, -1, -1, -2, -2, -2, -2, -3, -3, -3, -3, -3, -1, -1, -1, -1, -1, -1, 1, 1, 1, 0, -1, -1, -1, -1, -1, -1, -1 (list; graph; refs; listen; history; text; internal format)
   OFFSET 1,30 COMMENTS Say d is a "floor quotient" of n if d = [n/k] for some positive integer k. This defines a partial order relation on the positive integers. This sequence records the Moebius function values of this poset. LINKS Andrew Howroyd, Table of n, a(n) for n = 1..10000 J.-P. Cardinal, Symmetric matrices related to the Mertens function, arXiv:0811.3701 [math.NT], 2008-2009. J. C. Lagarias and D. H. Richman, The floor quotient partial order, Adv. Appl. Math., 153 (2024); arXiv:2212.11689 [math.NT], 2022-2023. EXAMPLE For n = 9, the set of floor quotients of 9 are Q(9) = {1, 2, 3, 4, 9} with Moebius values a(1) = 1, a(2) = -1, a(3) = -1, and a(4) = 0. The Moebius recursion requires that the Moebius values summed over Q(9) must equal zero, so a(9) = 1. MATHEMATICA LinearSolve[Table[If[Floor[i/j] > Floor[i/(j + 1)], 1, 0], {i, n}, {j, n}], UnitVector[n, 1]] PROG (PARI) seq(n)={my(v=vector(n)); v[1]=1; for(n=2, #v, my(S=Set(vector(n-1, k, n\(k+1)))); v[n]=-sum(i=1, #S, v[S[i]])); v} \\ Andrew Howroyd, Jan 24 2023 CROSSREFS Cf. A002321, A008683, A360079. Sequence in context: A163529 A283655 A262742 * A027354 A192227 A102673 Adjacent sequences: A360075 A360076 A360077 * A360079 A360080 A360081 KEYWORD sign,look AUTHOR Harry Richman, Jan 24 2023 STATUS approved
  
  Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
  Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
  The OEIS Community | Maintained by The OEIS Foundation Inc.
  
  Last modified September 8 08:25 EDT 2024. Contains 375752 sequences. (Running on oeis4.)
metadata: {"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}