This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A214394 If n mod 6 = 0 then n/6 else n. 1
 0, 1, 2, 3, 4, 5, 1, 7, 8, 9, 10, 11, 2, 13, 14, 15, 16, 17, 3, 19, 20, 21, 22, 23, 4, 25, 26, 27, 28, 29, 5, 31, 32, 33, 34, 35, 6, 37, 38, 39, 40, 41, 7, 43, 44, 45, 46, 47, 8, 49, 50, 51, 52, 53, 9, 55, 56, 57, 58, 59, 10, 61 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Jeremy Gardiner, Table of n, a(n) for n = 0..1000 Index entries for linear recurrences with constant coefficients, signature (0,0,0,2,0,0,0,-1). FORMULA a(n) = 2*a(n-4) - a(n-8). - G. C. Greubel, Oct 26 2017 a(n) = A244414(n) when n is not a multiple of 36 (A044102). - Michel Marcus, Oct 28 2017 a(n) = floor(n/6) + sign(n mod 6) * (n - floor(n/6)). - Wesley Ivan Hurt, Oct 28 2017 EXAMPLE a(36) = 36/6 = 6. MATHEMATICA Table[If[Mod[n, 6] == 0, n/6, n], {n, 0, 50}] (* G. C. Greubel, Oct 26 2017 *) PROG (PARI) a(n)=if(n%6, n, n/6) \\ G. C. Greubel, Oct 26 2017 (PARI) first(n) = my(res = vector(n, i, i-1)); forstep(i = 1, n, 6, res[i] \= 6); res \\ David A. Corneth, Oct 28 2017 CROSSREFS Cf. A026741, A051176, A214392. Cf. A044102, A244414. Sequence in context: A325976 A319654 A244414 * A255691 A030105 A255591 Adjacent sequences:  A214391 A214392 A214393 * A214395 A214396 A214397 KEYWORD nonn,easy AUTHOR Jeremy Gardiner, Jul 15 2012 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 October 15 15:14 EDT 2019. Contains 328030 sequences. (Running on oeis4.)