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!)
 A317627 a(n) = A317253 - floor(8*n/3). 2
 2, 3, 1, 1, 3, 1, 2, 1, -1, 1, 3, 1, 2, 3, 1, 1, 1, -1, 2, 1, -1, 1, 3, 1, 2, 3, 1, 1, 3, 1, 2, 1, -1, 1, 1, -1, 2, 3, 1, 1, 1, -1, 2, 1, -1, 1, 3, 1, 2, 3, 1, 1, 3, 1, 2, 1, -1, 1, 3, 1, 2, 3, 1, 1, 1, -1, 2, 1, -1, 1, 1, -1, 2, 3, 1, 1, 3, 1, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(3*n+1) = 2 - (n mod 2) for n >= 0, a(6*n+2) = 3 - 2*(n mod 2) and a(6*n+5) = a(3*n+2) for n >= 0, a(6*n+3) = 1 - 2*(n mod 2) and a(6*n+6) = a(3*n+3) for n >= 0. a(3*n+1) = A000034(n+1) for n >= 0. a(3*n+2) = A089607(n) for n > 1. a(3*n+2) = 2*A014577(n-1)+1 for n > 0. a(3*n+3) = A034947(n) = 2*A014577(n-1)-1 for n > 0. PROG (Python) n, f, i, p, q, base = 1, 1, 0, 0, 1, 3 while i < 100000: ....i, p, q = i+1, p*base, q*base ....if i == f: ........p, n = p+1, n+1 ........f = f*n n, a, j = 0, 0, 0 while p%q > 0: ....a, f, p, q = a+1, p//q, q, p%q ....if f == 1: ........n = n+1 ........print(n, a-1-(8*n//3)) CROSSREFS Cf. A000034, A014577, A034947,A089607, A317414. Sequence in context: A308297 A251045 A300521 * A271566 A296659 A270823 Adjacent sequences:  A317624 A317625 A317626 * A317628 A317629 A317630 KEYWORD sign AUTHOR A.H.M. Smeets, Aug 02 2018 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 September 16 23:53 EDT 2021. Contains 347477 sequences. (Running on oeis4.)