cp's OEIS Frontend

A037283 Replace n with concatenation of its odd divisors.

%I A037283 #24 Aug 07 2024 01:16:45
%S A037283 1,1,13,1,15,13,17,1,139,15,111,13,113,17,13515,1,117,139,119,15,
%T A037283 13721,111,123,13,1525,113,13927,17,129,13515,131,1,131133,117,15735,
%U A037283 139,137,119,131339,15,141,13721,143,111,13591545,123,147,13,1749,1525,131751
%N A037283 Replace n with concatenation of its odd divisors.
%H A037283 Reinhard Zumkeller, <a href="/A037283/b037283.txt">Table of n, a(n) for n = 1..10000</a>
%t A037283 dtn[ L_ ] := Fold[ 10#1+#2&, 0, L ] Array[ dtn[ Flatten[ Map[ IntegerDigits, Select[ Divisors[ # ], OddQ ] ] ] ]&, 50 ]
%t A037283 cod[n_]:=FromDigits[Flatten[IntegerDigits/@Select[Divisors[n],OddQ]]]; Array[cod,60] (* _Harvey P. Dale_, Jan 24 2014 *)
%o A037283 (Haskell)
%o A037283 a037283 = read . concat . (map show) . a182469_row :: Integer -> Integer
%o A037283 -- _Reinhard Zumkeller_, May 01 2012
%o A037283 (Python)
%o A037283 from sympy import divisors
%o A037283 def a(n): return int("".join(str(d) for d in divisors(n) if d%2==1))
%o A037283 print([a(n) for n in range(1, 52)]) # _Michael S. Branicky_, Dec 31 2020
%Y A037283 Cf. A182469, A037278, A037284, A037285.
%K A037283 nonn,base,easy
%O A037283 1,3
%A A037283 _N. J. A. Sloane_
%E A037283 More terms from _Erich Friedman_