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!)
A176558 a(n) is the reverse concatenation of divisors of n. 34

%I #33 Dec 31 2020 09:33:16

%S 1,21,31,421,51,6321,71,8421,931,10521,111,1264321,131,14721,15531,

%T 168421,171,1896321,191,20105421,21731,221121,231,2412864321,2551,

%U 261321,27931,28147421,291,30151065321,311,32168421,331131,341721,35751,361812964321,371

%N a(n) is the reverse concatenation of divisors of n.

%C Union of A089374(n) for n >= 1 and A175354(n) for n >= 2. - _Jonathan Vos Post_, Apr 17 2011

%H Indranil Ghosh, <a href="/A176558/b176558.txt">Table of n, a(n) for n = 1..50000</a>

%e For n=12; divisors of 12: 1,2,3,4,6,12; a(12)=1264321 (reverse concatenation).

%p a:= n-> parse(cat(sort([numtheory[divisors](n)[]], `>`)[])):

%p seq(a(n), n=0..40); # _Alois P. Heinz_, Dec 31 2020

%t Table[FromDigits@ Flatten@ Map[IntegerDigits, Reverse@ Divisors@ n], {n, 34}] (* _Michael De Vlieger_, Jan 23 2017 *)

%o (PARI) a(n) = {s = ""; fordiv(n, d, s = concat(Str(d), s)); eval(s);} \\ _Michel Marcus_, Feb 16 2015

%o (Python)

%o from sympy import divisors

%o def a(n): return int("".join(str(d) for d in divisors(n)[::-1]))

%o print([a(n) for n in range(1, 35)]) # _Michael S. Branicky_, Dec 31 2020

%Y Cf. A089374, A175354, A175355, A176588, A176589.

%K nonn,base

%O 1,2

%A _Jaroslav Krizek_, Apr 20 2010

%E More terms from _Charles R Greathouse IV_, Apr 23 2010

%E Corrected by _Jaroslav Krizek_, Apr 26 2010

%E Edited by _Charles R Greathouse IV_, Apr 30 2010

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 May 6 11:44 EDT 2024. Contains 372293 sequences. (Running on oeis4.)