Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A061915
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A061915
%S A061915 0,2,2,6,4,1,6,686,8,666,2,22,444,2002,686,1,464,646,666,646,2,6006,22,
               828,888,1,
%T A061915 2002,8886888,868,464,6,868,4224,66,646,1,828,222,646,6006,4,22222,6006,
               68886,44,1,
%U A061915 828,282,4224,686,1,42024,4004,424,8886888,1,8008,68286,464,68086,6
%V A061915 0,2,2,6,4,-1,6,686,8,666,2,22,444,2002,686,-1,464,646,666,646,2,6006,
               22,828,888,-1,
%W A061915 2002,8886888,868,464,6,868,4224,66,646,-1,828,222,646,6006,4,22222,6006,
               68886,44,-1,
%X A061915 828,282,4224,686,-1,42024,4004,424,8886888,-1,8008,68286,464,68086,6
%N A061915 Obtain m by omitting trailing zeros from n; a(n) = smallest multiple 
               k*m which is a palindrome with even digits, or -1 if no such multiple 
               exists.
%C A061915 a(n) = -1 if and only if m ends with the digit 5.
%H A061915 P. De Geest, <a href="http://www.worldofnumbers.com/em36.htm">Smallest 
               multipliers to make a number palindromic</a>.
%e A061915 For n = 30 we have m = 3; 3*2 = 6 is a palindrome with even digits, so 
               a(30) = 6.
%o A061915 (ARIBAS): stop := 500000; for n := 0 to 60 do k := 1; test := true; while 
               test and k < stop do mp := omit_trailzeros(n)*k; if test := not all_even(mp) 
               or mp <> int_reverse(mp) then inc(k); end; end; if k < stop then 
               write(mp," "); else write(-1," "); end; end;
%Y A061915 Cf. A050782, A062293, A061816, A061906. Values of k are given in A061916.
%Y A061915 Sequence in context: A130712 A130728 A092384 this_sequence A138565 A137316 
               A064851
%Y A061915 Adjacent sequences: A061912 A061913 A061914 this_sequence A061916 A061917 
               A061918
%K A061915 base,sign,easy
%O A061915 0,2
%A A061915 Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Jun 25 2001

    
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 December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research