The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A260348 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A260348

Numbers n such that n is divisible by (10^k - digitsum(n)), where k equals the number of digits of digitsum(n).
(history; published version)

#34 by OEIS Server at Fri Aug 28 17:48:15 EDT 2015

LINKS

Pieter Post, <a href="/A260348/b260348_1.txt">Table of n, a(n) for n = 1..12089</a>

#33 by Charles R Greathouse IV at Fri Aug 28 17:48:15 EDT 2015

STATUS

editing

approved

Discussion

Fri Aug 28

17:48

OEIS Server: Installed new b-file as b260348.txt.  Old b-file is now b260348_1.txt.

#32 by Charles R Greathouse IV at Fri Aug 28 17:48:14 EDT 2015

PROG

....if c%kl==0:

(PARI) isok(n) = {my(sd = sumdigits(n); , nsd = #digits(sd)); n % (10^nsd - sd) == 0; } \\ Michel Marcus, Aug 05 2015

KEYWORD

nonn,base,less

STATUS

proposed

editing

#31 by Michael De Vlieger at Wed Aug 05 08:07:27 EDT 2015

STATUS

editing

proposed

#30 by Michael De Vlieger at Wed Aug 05 08:07:23 EDT 2015

MATHEMATICA

Divisible[n, 10^k - d]]; Select[Range@ 210, 314, fQ] (* or *)

Select[Range@ 210, 314, Divisible[#, (10^(Floor[Log[10, Total@ IntegerDigits@ #]] + 1) - Total@ IntegerDigits@ #)] &] (* Michael De Vlieger, Aug 05 2015 *)

#29 by Michael De Vlieger at Wed Aug 05 08:02:43 EDT 2015

MATHEMATICA

Select[Range@ 210, Divisible[#, (10^(Floor[Log[10, Total@ IntegerDigits@ #]] + 1) - Total@ IntegerDigits@ #)] &] (* Michael De Vlieger, Aug 05 2015 *)

Discussion

Wed Aug 05

08:07

Michael De Vlieger: Killed a second period (full stop) in the title, added a program that avoids Log_10(sod) by memoizing the sod() function (since it's called twice) and using IntegerLength[sod].

#28 by Michael De Vlieger at Wed Aug 05 08:02:16 EDT 2015

NAME

Numbers n such that n is divisible by (10^k - digitsum(n)), where k equals the number of digits of digitsum(n)..

MATHEMATICA

fQ[n_] := Block[{d = Total@ IntegerDigits@ n, k}, k = IntegerLength@ d;

Divisible[n, 10^k - d]]; Select[Range@ 210, fQ] (* or *)

Select[Range@ 210, Divisible[#, (10^(Floor[Log[10, Total@ IntegerDigits@ #]] + 1) - Total@ IntegerDigits@ #)] &] (* Michael De Vlieger, Jul 23 Aug 05 2015 *)

STATUS

proposed

editing

#27 by Pieter Post at Wed Aug 05 06:48:35 EDT 2015

STATUS

editing

proposed

#26 by Pieter Post at Wed Aug 05 06:48:05 EDT 2015

PROG

(Python)

#25 by Pieter Post at Wed Aug 05 06:46:12 EDT 2015

COMMENTS

This sequence is infinite because all numbers with a sod digitsum equal to 9 are part of this sequence.