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
%I A110404
%S A110404 1,3,7,9,11,313131,7171717171717171,919191919191919191,121212,
%T A110404 3232323232323232323232,727272,9292929292929292929292929292,
%U A110404 131313131313131313131313131313,33,737373,939393,1414141414
%N A110404 Least multiple of n which is a repeated reverse concatenation of digits 
               of n where n == 1, 3, 7 or 9 (mod 10).
%e A110404 For 13 the term is 313131 as 313131 = 13*24087.
%t A110404 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 *)
%Y A110404 Cf. A110405.
%Y A110404 Sequence in context: A046807 A114788 A085074 this_sequence A087064 A087550 
               A047241
%Y A110404 Adjacent sequences: A110401 A110402 A110403 this_sequence A110405 A110406 
               A110407
%K A110404 base,easy,nonn
%O A110404 1,2
%A A110404 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 30 2005
%E A110404 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Jul 30 2005

    
page 1

Search completed in 0.001 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research