login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110404 Least multiple of n which is a repeated reverse concatenation of digits of n where n == 1, 3, 7 or 9 (mod 10). 1
1, 3, 7, 9, 11, 313131, 7171717171717171, 919191919191919191, 121212, 3232323232323232323232, 727272, 9292929292929292929292929292, 131313131313131313131313131313, 33, 737373, 939393, 1414141414 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

EXAMPLE

For 13 the term is 313131 as 313131 = 13*24087.

MATHEMATICA

f[n_] := Block[{k = 1, id = Reverse[ IntegerDigits[n]]}, While[fd = FromDigits[ Flatten[ Table[id, {k}]]]; Mod[fd, n] != 0, k++ ]; fd]; lst = Select[ Range[1, 41, 2], Mod[ #, 5] != 0 &]; f /@ lst (* Robert G. Wilson v *)

CROSSREFS

Cf. A110405.

Sequence in context: A114788 A085074 A175637 * A190366 A190742 A190752

Adjacent sequences:  A110401 A110402 A110403 * A110405 A110406 A110407

KEYWORD

base,easy,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 30 2005

EXTENSIONS

More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 30 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 10:28 EST 2012. Contains 205763 sequences.