cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A111104 Difference between successive terms of A051484.

Original entry on oeis.org

2, 1, 4, 6, 6, 6, 18, 18, 48, 30, 12, 30, 6, 42, 66, 42, 150, 18, 12, 48, 6, 72, 12, 30, 138, 60, 18, 84, 204, 54, 36, 6, 144, 12, 156, 24, 18, 60, 36, 6, 126, 48, 18, 168, 42, 12, 12, 204, 78, 6, 6, 18, 54, 84, 30, 24, 18, 150, 72, 6, 6, 36, 42, 66, 126, 318, 186, 18, 24, 54
Offset: 1

Views

Author

Walter Kehowski, Oct 14 2005

Keywords

Comments

All elements of A051484 from the fourth element, 7, onward are either 1 or 7 modulo 12. Each difference between successive terms of A051484 from the fourth term, 7, onward are equal to 0 or 6 modulo 12.

Examples

			a(8)=A051484(8)-A051484(7)=43-25=18.
		

Crossrefs

Cf. A051484.

Programs

  • Maple
    M:=[0,2]: isElement := proc(n) global M; local b, j, k; b:=true; for j from 1 to nops(M)-1 do for k from j+1 to nops(M) do if M[j] = n mod M[k] then b:=false; break; fi od od; return b end: for z to 1 do for n from 3 to 1000 do if isElement(n) then M:=[op(M),n] fi od od; M; map(proc(k) M[k]-M[k-1] end, [$2..nops(M)]);
  • Mathematica
    a[1] = 0; a[2] = 2; a[n_] := a[n] = Block[{k = a[n - 1] + 1, t = a[ # ] & /@ Range[n - 1]}, While[ Intersection[t, Union[ Mod[k, Rest[ t]]]] != {}, k++ ]; k]; t = Table[ a[n], {n, 71}]; Drop[t, 1] - Drop[t, -1] (* Robert G. Wilson v *)

Formula

a(n) = A051484(n+1)-A051484(n), n>=1.

Extensions

More terms from Robert G. Wilson v, Oct 19 2005

A111115 First differences of A051484, namely A111104, that are greater than any previous difference.

Original entry on oeis.org

2, 4, 6, 18, 48, 66, 150, 204, 318, 348, 450, 486, 546, 696, 1050
Offset: 1

Views

Author

Walter Kehowski, Oct 15 2005

Keywords

Comments

The sequence is unbounded and all terms from the third onward are 0 modulo 6.

Crossrefs

Programs

  • Maple
    M:=[0,2]: isElement := proc(n) global M; local b, j, k; b:=true; for j from 1 to nops(M)-1 do for k from j+1 to nops(M) do if M[j] = n mod M[k] then b:=false; break; fi od od; return b end: for z to 1 do for n from 3 while M[ -1]-M[ -2]<1000 do if isElement(n) then M:=[op(M),n] fi od od; M; SDM:=[]: sdmax:=0: for z to 1 do for k from 1 to nops(M)-1 do sd:=M[k+1]-M[k]; if sd>sdmax then sdmax:=sd; SDM:=[op(SDM),[k,M[k+1],sd]] fi od od; SDM; map(proc(z) SDM[z,3] end, [$1..nops(SDM)]);

Formula

a(1)=2, a(n)=A111104(j_n) where j_n is the first index such that A111104(j_n)>A111104(k) for all k
Showing 1-2 of 2 results.