Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111115
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111115 First differences of A051484, namely A111104, that are greater than any previous difference. +0
1
2, 4, 6, 18, 48, 66, 150, 204, 318, 348, 450, 486, 546, 696, 1050 (list; graph; listen)
OFFSET

1,1

COMMENT

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

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<j_n.

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)]);

CROSSREFS

Cf. A051484, A111104.

Sequence in context: A098853 A085146 A066894 this_sequence A143085 A005227 A108439

Adjacent sequences: A111112 A111113 A111114 this_sequence A111116 A111117 A111118

KEYWORD

nonn

AUTHOR

Walter A. Kehowski (wkehowski(AT)cox.net), Oct 15 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research