Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110404
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110404 Least multiple of n which is a repeated reverse concatenation of digits of n where n == 1, 3, 7 or 9 (mod 10). +0
2
1, 3, 7, 9, 11, 313131, 7171717171717171, 919191919191919191, 121212, 3232323232323232323232, 727272, 9292929292929292929292929292, 131313131313131313131313131313, 33, 737373, 939393, 1414141414 (list; graph; listen)
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: A046807 A114788 A085074 this_sequence A087064 A087550 A047241

Adjacent sequences: A110401 A110402 A110403 this_sequence 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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research