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!)
A055018 Numbers n such that n and n+1 are modest (cf. A054986). 2

%I #15 Jul 13 2013 12:02:30

%S 411,811,1421,2036,2044,2054,3054,4036,4044,4054,8036,12036,16036,

%T 20036,24036,28036,32036,40011,40044,50054,50074,80011,88296,100110,

%U 100270,100369,120296,120404,140021,144242,176296,200044,200270,200369

%N Numbers n such that n and n+1 are modest (cf. A054986).

%H Reinhard Zumkeller, <a href="/A055018/b055018.txt">Table of n, a(n) for n = 1..250</a>

%e 2036 is modest because Mod[2036, 36] = 20. 2037 is modest because Mod[2037, 037] = 2. Hence 2036 is this pair's modest twin representative.

%o (Haskell)

%o import Data.List (elemIndices)

%o a055018 n = a055018_list !! (n-1)

%o a055018_list = map (a054986 . (+ 1)) $ elemIndices 1 $

%o zipWith (-) (tail a054986_list) a054986_list

%o -- _Reinhard Zumkeller_, Mar 26 2012

%K base,easy,nonn

%O 1,1

%A _Hans Havermann_, May 31 2000

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 23 07:16 EDT 2024. Contains 371905 sequences. (Running on oeis4.)