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!)
A213817 Numbers n with the property that cyclically right-shifting by 2 positions divides n by 9 (leading 0's omitted). 1

%I #18 Jun 28 2012 17:40:26

%S 197802,296703,395604,494505,593406,692307,791208,890109,989010,

%T 197802197802,296703296703,395604395604,494505494505,593406593406,

%U 692307692307,791208791208,890109890109,989010989010,197802197802197802,296703296703296703,395604395604395604

%N Numbers n with the property that cyclically right-shifting by 2 positions divides n by 9 (leading 0's omitted).

%H Alois P. Heinz, <a href="/A213817/b213817.txt">Table of n, a(n) for n = 1..500</a>

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Transposable_integer">Transposable integer</a>

%F a(n) = 9/91*(2+((n-1) mod 9))*(10^(6*floor((n+8)/9))-1). - _Alois P. Heinz_, Jun 28 2012

%e 197802 belongs to this sequence, since 21978 is obtained by moving the two least significant digits "02" to the front and 197802/9 = 21978.

%p a:= proc(n) local h;

%p 9/91*(2+irem(n-1, 9, 'h'))*(10^(6*(h+1))-1)

%p end:

%p seq (a(n), n=1..30); # _Alois P. Heinz_, Jun 28 2012

%t lst = {}; Do[d = IntegerDigits[n]; m = FromDigits@Take[d, -2]*10^(IntegerLength[n] - 2) + FromDigits@Drop[d, -2]; If[n/9 == m, AppendTo[lst, n]], {n, 18, 10^6, 9}]; lst

%K base,nonn

%O 1,1

%A _Arkadiusz Wesolowski_, Jun 22 2012

%E More terms from _Alois P. Heinz_, Jun 28 2012

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 06:04 EDT 2024. Contains 371906 sequences. (Running on oeis4.)