The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A329152 a(n) = Sum_{i=1..n-1} Sum_{j=1..i-1} [1 == i*j (mod n)], where [] is the Iverson bracket. 2
 0, 0, 0, 0, 1, 0, 2, 0, 2, 1, 4, 0, 5, 2, 2, 2, 7, 2, 8, 2, 4, 4, 10, 0, 9, 5, 8, 4, 13, 2, 14, 6, 8, 7, 10, 4, 17, 8, 10, 4, 19, 4, 20, 8, 10, 10, 22, 4, 20, 9, 14, 10, 25, 8, 18, 8, 16, 13, 28, 4, 29, 14, 16, 14, 22, 8, 32, 14, 20, 10, 34, 8, 35, 17, 18, 16, 28, 10, 38, 12 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,7 COMMENTS In other words, a(n) is the number of choices for k, 1 <= k <= n, so that k*n + 1 has the form a*b for 1 < a < b < n. Solutions exist only when 1 <= k <= n - 3. Any odd number greater than 3 has at least one solution, 2*ceiling(n/2). Observations: - Unique values of a(n) exist, 6 = a(32), 24 = a(240), 126 = a(512), 144 = a(1320), ..., and n mod 8 = 0. - If a(n) is an odd prime then a(n) = a(2*n) OR a(n) = a(n/2). For example, 1013 = a(2029) = a(2197) = a(4058) = a(4394). LINKS EXAMPLE a(1)=0 because there is no solution to k*1 + 1 = a*b, 1 < a < b < n, 1 <= k < n. a(5)=1 because 1 == 3*2 (mod 5). a(7)=2 because 1 == 4*2 == 5*3 (mod 7). a(11)=4 because 1 == 4*3 == 6*2 == 8*7 == 9*5 (mod 11). a(13)=5 because 1 == 7*2 == 8*5 == 9*3 == 10*4 = 11*6 (mod 13). a(32)=6 because 1 == 11*3 == 13*5 == 23*7 == 25*9 == 27*19 == 29*21 (mod 32). MATHEMATICA Array[Sum[Sum[Boole[Mod[i j, #] == 1], {j, i - 1}], {i, # - 1}] &, 80] (* Michael De Vlieger, Mar 15 2020 *) PROG (PARI) a(n) = {my(x=0); for (i = 1, n - 1, for (ii = 1, i - 1, if(1 == ((ii*i) % n), x++))); return(x)} for (n = 1, 100, print1(a(n), ", ")) CROSSREFS Sequence in context: A305804 A053470 A308202 * A337563 A278648 A353508 Adjacent sequences:  A329149 A329150 A329151 * A329153 A329154 A329155 KEYWORD nonn AUTHOR Torlach Rush, Feb 25 2020 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 July 6 14:10 EDT 2022. Contains 355110 sequences. (Running on oeis4.)
{"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, "url": "https://oeis.org/A329152", "fetch_time": 1657132198000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2022-27/segments/1656104676086.90/warc/CC-MAIN-20220706182237-20220706212237-00044.warc.gz", "warc_record_offset": 468370120, "warc_record_length": 4308, "token_count": 1014, "char_count": 2257, "score": 3.796875, "int_score": 4, "crawl": "CC-MAIN-2022-27", "snapshot_type": "latest", "language": "en", "language_score": 0.6571042537689209, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00029-of-00064.parquet"}