1,1

The Basveo Algorithm 1) Pick an integer N 2) convert N into base B e.g. base16 3) Extract the last digit from N when represented in Base B and call it L 4) pick another integer D and divide L/D 5) Pick two functions you would like to apply to N Functions F and G e.g. F(N)=N+1 and G(N)= N-1 6) If L/D == a-integer then apply function F to N 7) Else if L/D === a-non-integer then apply function G to N 8) take your new N and apply the Algorithm to your new N I amount of times.

PreBasveo[w_, x_] := Ceiling[x/w - Floor[x/w]]*5; Basveo[w_, x_, y_, z_, i_] := If[PreBasveo[w, Last[IntegerDigits[y, x]]] > 0, y + z, y + i]; ItterativeBasveo[x1_, x2_, x3_, x4_, x5_, x6_] := Catch[Basvar = x4; For[i = 1, i < x1, Basvar = Basveo[x2, x3, Basvar, x5, x6]; i++ ]; Throw[Basvar] ]; SqrRange[x_] := IntegerPart[x]; TriRange[x_] := IntegerPart[(Sqrt[8x + 1] - 1)/2]; For[A=2, A<32, Print[Mod[ItterativeBasveo[SqrRange[A]^2-SqrRange[A], 7, 9, A, SqrRange[A], SqrRange[A]-1+SqrRange[SqrRange[A]]+1], 6]] ; A++ ];

Sequence in context: A132188 A060132 A059590 this_sequence A028733 A028789 A038100

Adjacent sequences: A144702 A144703 A144704 this_sequence A144706 A144707 A144708

base,nonn

Luke Andrew Marsh (luke(AT)lamarsh.org.uk), Sep 19 2008