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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A319020 Let b_i(k) = 1 for k <= i; for n > i, b_i(n) = b_i(t(n)) + b_i(n-t(n)) where t = A063882. a(n) = 3*b_2(n)-2*n if n is even, a(n) = 3*b_4(n)-n if n is odd. 2
2, -1, 0, 1, 1, 0, -1, -1, 0, 1, 1, 0, 2, -1, 0, 1, -2, 0, 2, -1, 0, 1, 1, 0, 2, -1, 0, 1, -2, 0, -1, -1, 0, -2, 1, 0, -1, 2, -3, 1, 1, -3, 2, -1, 3, -2, 1, 0, -1, -1, 0, 1, -2, 0, 2, -1, 0, -2, 1, 0, -1, -1, 0, -2, 1, 0, -1, 2, 0, 1, -2, 3, -1, -1, 3, -2, 1, -3, 2, -1, 0, 1, -2, 0, 2, -4, 3, -2, 4, -3, 2, -1, 0, -2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
PROG
(PARI) t=f=g=vector(200); t[1]=t[2]=t[3]=t[4]=1; for(n=5, #t, t[n] = t[n-t[n-1]]+t[n-t[n-4]]); f[1]=f[2]=1; for(n=3, #f, f[n] = f[t[n]]+f[n-t[n]]); g[1]=g[2]=g[3]=g[4]=1; for(n=5, #g, g[n] = g[t[n]]+g[n-t[n]]); vector(200, n, if(n%2==0, 3*f[n]-2*n, 3*g[n]-n))
CROSSREFS
Sequence in context: A074871 A182641 A337939 * A099200 A358351 A093578
KEYWORD
sign,look
AUTHOR
Altug Alkan, Sep 08 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 07:31 EDT 2024. Contains 370955 sequences. (Running on oeis4.)