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

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195610 Smallest k such that A014657(n) divides 2^k + 1. 3
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, 53, 18, 14, 55, 50, 7, 65, 34, 69, 14, 74, 26, 81, 78, 9, 86, 29, 89, 90, 18, 48, 98, 33, 10, 45, 105, 113, 38, 12, 81, 41, 25, 8, 26, 134, 46, 35, 47, 68, 146, 45 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..1000

PROG

(Haskell)

import Data.List (elemIndex)

import Data.Maybe (catMaybes)

a195610 n = a195610_list !! (n-1)

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

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

CROSSREFS

Cf. A000051, A195470.

Sequence in context: A194872 A194900 A194051 * A082654 A072636 A191741

Adjacent sequences:  A195607 A195608 A195609 * A195611 A195612 A195613

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Sep 21 2011

STATUS

approved

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 January 21 10:26 EST 2020. Contains 331105 sequences. (Running on oeis4.)