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!)
A069226 a(n) = gcd(n, 2^n + 1). 1

%I #11 Dec 14 2016 11:01:06

%S 1,1,3,1,1,1,1,1,9,5,1,1,1,1,3,1,1,1,1,1,3,1,1,1,1,1,27,1,1,5,1,1,3,1,

%T 1,1,1,1,3,1,1,1,1,1,9,1,1,1,1,25,3,1,1,1,11,1,3,1,1,1,1,1,9,1,1,1,1,

%U 17,3,5,1,1,1,1,3,1,1,13,1,1,81,1,1,1,1,1,3,1,1,5,1,1,3,1,1,1,1,1,9,1

%N a(n) = gcd(n, 2^n + 1).

%C First occurrence of n: a(1)=1, a(3)=3, a(10)=5, a(9)=9, a(55)=11, a(78)=13, a(68)=17, a(50)=25, a(27)=27, a(406)=29, a(165)=33, a(666)=37, a(301)=43, a(1378)=53, a(1711)=59, a(390)=65, a(81)=81, a(3403)=83, a(2328)=97, a(495)=99, ... - _R. J. Mathar_, Dec 14 2016

%t Table[GCD[n,2^n+1],{n,100}] (* _Harvey P. Dale_, Dec 12 2012 *)

%Y Cf. A014491, A049095, A049096, A060444.

%K nonn

%O 1,3

%A _Vladeta Jovovic_, Apr 12 2002

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 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)