login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A186771 Numbers m such that A186711(m) = 1. 5
1, 2, 3, 6, 12, 27, 48, 130, 252, 705, 1386, 2295, 7125, 17316, 31959, 51054, 74601, 102600, 351315, 748440, 2123189, 4198848, 6975417, 10452896, 14631285, 19510584, 25090793, 31371912, 38353941, 46036880, 54420729, 63505488, 73291157 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Greatest common divisor of A003586(a(n)) and A003586(a(n)+1)) = 1;

A186927(n) = A003586(a(n)); A186928(n) = A003586(a(n) + 1).

LINKS

Table of n, a(n) for n=1..33.

EXAMPLE

n = 12, a(12) = 2295:

A003586(2295) = 19342813113834066795298816 = 2^84,

A003586(2296) = 19383245667680019896796723 = 3^53 and GCD(2^84,3^53)=1.

PROG

(Haskell)

import Data.List (findIndices)

a186771 n = a186771_list !! (n-1)

a186771_list = map (+ 1) $ findIndices (== 1) a186711_list

CROSSREFS

Sequence in context: A152172 A001677 A024422 * A019525 A108915 A082395

Adjacent sequences:  A186768 A186769 A186770 * A186772 A186773 A186774

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Feb 26 2011

EXTENSIONS

a(22)-a(33) from Donovan Johnson, Mar 04 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 March 18 13:47 EDT 2019. Contains 321289 sequences. (Running on oeis4.)