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!)
A113924 a(n) = gcd(A113605(n+1), A113605(n)). Also, for n >= 2, a(n) = A113605(n+2) - A113605(n-1). 1

%I #15 Aug 10 2021 11:05:11

%S 1,1,1,2,1,3,1,1,4,1,1,5,1,2,1,1,1,1,8,1,3,1,1,2,1,1,1,11,2,1,1,1,1,2,

%T 1,1,5,1,4,1,1,1,1,2,19,1,1,1,10,1,7,3,1,2,1,1,1,1,6,1,1,1,5,6,1,1,1,

%U 1,2,1,3,7,1,4,1,1,1,5,2,1,1,1,1,2,1,1

%N a(n) = gcd(A113605(n+1), A113605(n)). Also, for n >= 2, a(n) = A113605(n+2) - A113605(n-1).

%p A113605 := proc(n) option remember ; if n <=3 then 1 ; else A113605(n-3)+gcd(A113605(n-1),A113605(n-2)) ; fi ; end: A113924 := proc(n) gcd(A113605(n+1),A113605(n)) ; end; seq(A113924(n),n=1..80) ; # _R. J. Mathar_, Jan 31 2008

%o (PARI) lista(nn) = my(w, x=1, y=1, z=1); print1("1"); for(n=2, nn, w=x+gcd(y, z); print1(", ", w-x); x=y; y=z; z=w); \\ _Jinyuan Wang_, Aug 10 2021

%Y Cf. A113605.

%K nonn

%O 1,4

%A _Leroy Quet_, Jan 30 2006

%E More terms from _R. J. Mathar_, Jan 31 2008

%E More terms from _Jinyuan Wang_, Aug 10 2021

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 August 11 17:02 EDT 2024. Contains 375073 sequences. (Running on oeis4.)