login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A104348 a(n) is the number of integers m such that m -(digit reversal of m) = 9*n. 2

%I #4 Mar 30 2012 17:26:11

%S 9,8,7,6,5,4,3,2,1,81,90,0,0,0,0,0,0,0,0,72,9,80,0,0,0,0,0,0,0,63,18,

%T 0,70,0,0,0,0,0,0,54,27,0,0,60,0,0,0,0,0,45,36,0,0,0,50,0,0,0,0,36,45,

%U 0,0,0,0,40,0,0,0,27,54,0,0,0,0,0,30,0,0,18,63,0,0,0,0,0,0,20,0,9,72,0,0,0

%N a(n) is the number of integers m such that m -(digit reversal of m) = 9*n.

%C For any n>0, a(n) is finite (or zero) and a(0) is infinite (because there are an infinite number of palindromes).

%e a(8)=2 because there are only two integers m such that m - (digit reversal of m) = 9*8=72, namely 80 and 91: 80-(08)=80-8=72 and 91-19=72.

%t A104348=Table[Select[Range[0, 40000], (FromDigits[Reverse[IntegerDigits[ # ]]]-#)/9==-k&]//Length, {k, 100}]

%Y Cf. A104347.

%K nonn,base

%O 1,1

%A _Zak Seidov_, Mar 02 2005

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 5 17:24 EDT 2024. Contains 374027 sequences. (Running on oeis4.)