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!)
 A286476 Compound filter: a(n) = 6*A032742(n) + (n mod 6), a(1) = 1. 7
 1, 8, 9, 16, 11, 18, 7, 26, 21, 34, 11, 36, 7, 44, 33, 52, 11, 54, 7, 62, 45, 70, 11, 72, 31, 80, 57, 88, 11, 90, 7, 98, 69, 106, 47, 108, 7, 116, 81, 124, 11, 126, 7, 134, 93, 142, 11, 144, 43, 152, 105, 160, 11, 162, 67, 170, 117, 178, 11, 180, 7, 188, 129, 196, 83, 198, 7, 206, 141, 214, 11, 216, 7, 224, 153, 232, 71, 234, 7, 242, 165, 250, 11, 252, 103 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 FORMULA a(1) = 1, for n > 1, a(n) = 6*A032742(n) + (n mod 6). MATHEMATICA With[{k = 6}, Table[If[n == 1, 1, k (Divisors[n][[-2]]) + Mod[n, k]], {n, 85}]] (* Michael De Vlieger, May 12 2017 *) PROG (Scheme) (define (A286476 n) (if (= 1 n) n (+ (* 6 (A032742 n)) (modulo n 6)))) (Python) from sympy import divisors def a(n): return 1 if n==1 else 6*divisors(n)[-2] + n%6 # Indranil Ghosh, May 12 2017 CROSSREFS Cf. A032742, A285729, A286472, A286473, A286474, A286475. Sequence in context: A292188 A301659 A265221 * A079669 A265732 A047393 Adjacent sequences:  A286473 A286474 A286475 * A286477 A286478 A286479 KEYWORD nonn AUTHOR Antti Karttunen, May 11 2017 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 August 15 01:47 EDT 2020. Contains 336485 sequences. (Running on oeis4.)