login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195610 Smallest k such that A014657(n) divides 2^k + 1. 3

%I

%S 0,0,1,2,3,5,6,4,9,10,9,14,5,18,10,7,26,9,29,30,6,33,27,41,24,15,50,

%T 53,18,14,55,50,7,65,34,69,14,74,26,81,78,9,86,29,89,90,18,48,98,33,

%U 10,45,105,113,38,12,81,41,25,8,26,134,46,35,47,68,146,45

%N Smallest k such that A014657(n) divides 2^k + 1.

%H Reinhard Zumkeller, <a href="/A195610/b195610.txt">Table of n, a(n) for n = 1..1000</a>

%o (Haskell)

%o import Data.List (elemIndex)

%o import Data.Maybe (catMaybes)

%o a195610 n = a195610_list !! (n-1)

%o a195610_list = catMaybes $ map k [1..] where

%o k x = elemIndex 0 $ map (`mod` x) $ take (fromInteger x) a000051_list

%Y Cf. A000051, A195470.

%K nonn

%O 1,4

%A _Reinhard Zumkeller_, Sep 21 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 20 21:57 EST 2020. Contains 332084 sequences. (Running on oeis4.)