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!)
A283672 a(n) = gcd(q(n - q(n+1) + 2), q(n - q(n) + 2)) where q(n) = A005185(n). 2
1, 1, 1, 2, 1, 1, 3, 3, 3, 4, 1, 4, 5, 1, 5, 1, 1, 6, 6, 6, 6, 8, 2, 2, 8, 8, 8, 8, 10, 1, 1, 10, 1, 1, 1, 11, 1, 11, 1, 1, 12, 12, 12, 12, 12, 16, 2, 1, 2, 4, 2, 2, 2, 14, 16, 2, 16, 16, 16, 16, 20, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 22, 1, 1, 23, 1, 1, 1, 1, 23, 24 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
EXAMPLE
a(4) = gcd(A005185(4 - A005185(5) + 2), A005185(4 - A005185(4) + 2)) = gcd(A005185(3), A005185(3)) = gcd(2, 2) = 2.
MATHEMATICA
q[1] = q[2] = 1; q[n_] := q[n] = q[n - q[n - 1]] + q[n - q[n - 2]]; Table[GCD[q[n - q[n + 1] + 2], q[n - q[n] + 2]], {n, 88}] (* Indranil Ghosh, Mar 14 2017 *)
PROG
a=vector(1001); a[1]=a[2]=1; for(n=3, #a, a[n]=a[n-a[n-1]]+a[n-a[n-2]]); va = vector(1000, n, gcd(a[n+2-a[n+1]], a[n+2-a[n]]))
CROSSREFS
Sequence in context: A240807 A355201 A334347 * A053268 A284828 A101417
KEYWORD
nonn
AUTHOR
Altug Alkan, Mar 14 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 17:20 EDT 2024. Contains 371962 sequences. (Running on oeis4.)