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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A065110 If n = D0*10^0 + D1*10^1 + D2*10^2 + .. + Dk*10^k define f(n) = D0*0^10 + D1*1^10 + D2*2^10 + .. + Dk*k^10 (e.g. if n = 421 then f(n) = 4*2^10 + 2*1^10 + 1*0^10 = 4098). Sequence gives values of n such that f(n) is divisible by n. 0
385, 1036, 1273, 3574, 18362, 25194, 61725, 119471, 142223, 203190, 284446, 886449, 1568395, 2498685, 6259852, 13060174, 61190538 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..17.

EXAMPLE

If n = 385 then f(n) = 3*2^10+8*1^10+5*0^10 = 3080 = 8*385.

MATHEMATICA

nmax = 10^6; f[n_] := (id = Reverse[IntegerDigits[n]]; id.Range[0, Length[id] - 1]^10); Reap[For[n = 1, n < nmax, n++, If[n > 9 && Divisible[f[n], n], Print[n]; Sow[n]]]][[2, 1]] (* Jean-Fran├žois Alcover, Oct 30 2017 *)

CROSSREFS

Sequence in context: A229853 A317272 A157354 * A200525 A225711 A204712

Adjacent sequences:  A065107 A065108 A065109 * A065111 A065112 A065113

KEYWORD

base,nonn,more

AUTHOR

Jonathan Ayres (jonathan.ayres(AT)btinternet.com), Nov 12 2001

EXTENSIONS

Corrected and extended by Vladeta Jovovic, Nov 18 2001

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 17 04:09 EDT 2019. Contains 328106 sequences. (Running on oeis4.)