login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A085757
Differences between successive multiples of either 11 or 19.
0
11, 8, 3, 11, 5, 6, 11, 2, 9, 10, 1, 11, 7, 4, 11, 4, 7, 11, 1, 10, 9, 2, 11, 6, 5, 11, 3, 8, 11, 11, 8, 3, 11, 5, 6, 11, 2, 9, 10, 1, 11, 7, 4, 11, 4, 7, 11, 1, 10, 9, 2, 11, 6, 5, 11, 3, 8, 11, 11, 8, 3, 11, 5, 6, 11, 2, 9, 10, 1, 11, 7, 4, 11, 4, 7, 11, 1, 10, 9, 2, 11, 6, 5, 11, 3, 8, 11
OFFSET
0,1
MATHEMATICA
With[{nn=90}, Differences[Union[Join[11*Range[0, nn], 19*Range[0, nn]]]]] (* Harvey P. Dale, Jan 30 2015 *)
PROG
(PARI) maxn=100; i11=0; i19=0; n=1; {until(n>maxn, a=min(i11*11, i19*19); if(n>1, print1(a-last ", "); ); last=a; n++; if(a/11==i11, i11++); if(a/19==i19, i19++); ); }
(Python)
def diff(lst):
return [lst[i+1]-lst[i] for i in range(len(lst)-1)]
def auptomult(N):
return diff(sorted(set([k*i for k in [11, 19] for i in range(N//k+1)])))
print(auptomult(630)) # Michael S. Branicky, Nov 08 2021
CROSSREFS
Sequence in context: A055505 A159526 A090841 * A003567 A085688 A164059
KEYWORD
nonn
AUTHOR
Jon Perry, Jul 22 2003
EXTENSIONS
Corrected and extended by Ray Chandler, Aug 10 2003
STATUS
approved