|
| |
|
|
A037277
|
|
Replace n by concatenation of its divisors >1.
|
|
1
| |
|
|
0, 2, 3, 24, 5, 236, 7, 248, 39, 2510, 11, 234612, 13, 2714, 3515, 24816, 17, 236918, 19, 2451020, 3721, 21122, 23, 234681224, 525, 21326, 3927, 2471428, 29, 2356101530, 31, 2481632, 31133, 21734, 5735, 23469121836, 37, 21938, 31339
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
MATHEMATICA
| FromDigits[Flatten[IntegerDigits/@Rest[Divisors[#]]]]&/@Range[40] (* From Harvey P. Dale, Nov 06 2011 *)
|
|
|
PROG
| (Haskell)
a037277 1 = 0
a037277 n = read $ concat $ map show $ tail $ divisors n :: Integer
where divisors n = filter ((== 0) . mod n) [1..n]
-- Reinhard Zumkeller, Feb 07 2011
|
|
|
CROSSREFS
| Sequence in context: A076530 A115031 A030418 * A001783 A095996 A061098
Adjacent sequences: A037274 A037275 A037276 * A037278 A037279 A037280
|
|
|
KEYWORD
| nonn,easy,base,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Erich Friedman (erich.friedman(AT)stetson.edu).
|
| |
|
|
