The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A199974 a(n) = the sum of LCQ_C(n, k) for 1 <= k <= n (see definition in comments). 2
 2, 6, 7, 14, 12, 25, 18, 28, 28, 33, 28, 64, 35, 47, 51, 59, 45, 76, 51, 81, 68, 74, 61, 128, 72, 88, 87, 103, 78, 145, 84, 119, 107, 114, 101, 195, 101, 129, 126, 166 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Definition of LCQ_C: The least common non-divisor of type C (LCQ_C) of two positive integers a and b (a<=b) is the least positive non-divisor q of numbers a and b such that 1<=q common to a and b. LCQ_C(a, b) >= 2. LINKS EXAMPLE For n = 6, a(6) = 9 because LCQ_B(6, 1) = 4, LCQ_B(6, 2) = 4, LCQ_B(6, 3) = 4, LCQ_B(6, 4) = 5, LCQ_B(6, 5) = 4, LCQ_B(6, 6) = 4. Sum of results is 25. CROSSREFS Cf.: A196443 (the sum of GCQ_A(n, k) for 1 <= k <= n). Cf.: A199972 (the sum of GCQ_B(n, k) for 1 <= k <= n). Cf.: A199971 (the sum of LCQ_A(n, k) for 1 <= k <= n). Cf.: A199973 (the sum of LCQ_B(n, k) for 1 <= k <= n). Sequence in context: A092310 A306924 A087376 * A176279 A265739 A281167 Adjacent sequences:  A199971 A199972 A199973 * A199975 A199976 A199977 KEYWORD nonn AUTHOR Jaroslav Krizek, Nov 26 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 9 06:59 EDT 2020. Contains 333344 sequences. (Running on oeis4.)