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

 

Logo

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A008919 Numbers n such that n written backwards is a nontrivial multiple of n. 8
1089, 2178, 10989, 21978, 109989, 219978, 1099989, 2199978, 10891089, 10999989, 21782178, 21999978, 108901089, 109999989, 217802178, 219999978, 1089001089, 1098910989, 1099999989, 2178002178, 2197821978, 2199999978, 10890001089 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

There are 2*Fibonacci([(n-2)/2]) terms with n digits (this is essentially twice A103609). - N. J. A. Sloane, Mar 20 2013

REFERENCES

Leonard F. Klosinski and Dennis C. Smolarski, On the Reversing of Digits, Math. Mag., 42 (1969), 208-210.

R. Webster and G. Williams, On the Trail of Reverse Divisors: 1089 and All that Follow, Mathematical Spectrum, Applied Probability Trust, Sheffield, Vol. 45, No. 3, 2012/2013, pp. 96 - 102.

D. Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986.

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 1..400

N. J. A. Sloane, 2178 And All That, Fib. Quart., 52 (2014), 99-120.

Eric Weisstein's World of Mathematics, Reversal

FORMULA

If reverse(n) = k*n in base 10, then k = 1, 4 or 9 [Klosinski and Smolarski]. Hence A008919 is the union of A001232 and A008918. - David W. Wilson

MATHEMATICA

Reap[ Do[ If[ Reverse[ IntegerDigits[n]] == IntegerDigits[4*n], Print[n]; Sow[n]]; If[ Reverse[ IntegerDigits[n + 11]] == IntegerDigits[9*(n + 11)], Print[n + 11]; Sow[n + 11]], {n, 78, 2*10^10, 100}]][[2, 1]] (* Jean-Fran├žois Alcover, Jun 19 2012, after David W. Wilson, assuming n congruent to 78 or 89 mod 100 *)

okQ[t_]:=t==Reverse[t]&&First[t]!=0&&Min[Length/@Split[t]]>1; Sort[ Flatten[ {99#, 198#}&/@Flatten[Table[FromDigits/@Select[Tuples[ {0, 1}, n], okQ], {n, 10}]]]] (* Harvey P. Dale, Jul 03 2013 *)

PROG

(Haskell)

a008919 n = a008919_list !! (n-1)

a008919_list = [x | x <- [1..],

                    let (x', m) = divMod (a004086 x) x, m == 0, x' > 1]

-- Reinhard Zumkeller, Feb 03 2012

CROSSREFS

Cf. A001232, A004086, A008918, A214927, A103609. Reversals are in A031877.

Sequence in context: A175698 A110819 A071685 * A110843 A023093 A001232

Adjacent sequences:  A008916 A008917 A008918 * A008920 A008921 A008922

KEYWORD

nonn,base,nice

AUTHOR

N. J. A. Sloane.

EXTENSIONS

Corrected and extended by David W. Wilson Aug 15 1996, Dec 15 1997.

STATUS

approved

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

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

Last modified July 28 06:18 EDT 2014. Contains 244987 sequences.