|
%I #21 Aug 05 2022 15:48:22
%S 109,111,123,135,147,159,161,173,185,197,208,210,222,234,246,258,260,
%T 272,284,296,307,319,321,333,345,357,369,371,383,395,406,418,420,432,
%U 444,456,468,470,482,494,505,517,529,531,543,555,567,579,581,593,604,616
%N Numbers > 100 with decimal digits in arithmetic progression mod 10.
%C This sequence contains straight-line numbers > 99 (A135643).
%C Each set of numbers from 10^n to 10^(n+1) contains 90 of these numbers. - _T. D. Noe_, Nov 12 2013
%C The sequence mod 100 has period 900, the sequence mod 90 has period 8100. - _Paul Tek_, Nov 14 2013
%H Michael S. Branicky, <a href="/A231701/b231701.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Paul Tek)
%e (8,2,6,0,4,...) is an arithmetic progression mod 10, hence the number 82604 appears in this sequence.
%t Select[Range[100, 10^3], Length[Union[Mod[Differences[IntegerDigits[#]], 10]]] <= 1 &] (* _T. D. Noe_, Nov 12 2013 *)
%o (PARI) a(n) = my(len=3+(n-1)\90, \
%o fs=10+((n-1)%90), \
%o f=fs\10, \
%o s=fs%10); \
%o return(sum(i=1,len,10^(len-i)*((f+(i-1)*(s-f))%10)))
%o (Python)
%o from itertools import count, islice
%o def agen(): yield from (int("".join(str((s0+i*r)%10) for i in range(d))) for d in count(3) for s0 in range(1, 10) for r in range(-s0, 10-s0))
%o print(list(islice(agen(), 52))) # _Michael S. Branicky_, Aug 05 2022
%Y Cf. A135643, A231588.
%K nonn,base
%O 1,1
%A _Paul Tek_, Nov 12 2013
|
