|
| |
|
|
A144705
|
|
A nonsense sequence.
|
|
0
|
|
|
|
2, 3, 6, 7, 8, 10, 10, 26, 26, 29, 29, 29, 29, 33, 62, 65, 68, 65, 68, 69
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Previous name was: An example of a sequence produced by the Basveo Algorithm.
The Basveo Algorithm
1) Pick an integer N;
2) Convert N into base B, e.g., B=16;
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 is an integer then apply function F to N;
7) Else if L/D is not an integer then apply function G to N;
8) Take your new N and apply the Algorithm to your new N a total of I times.
|
|
|
LINKS
|
|
|
|
MATHEMATICA
|
(* Warning: the following program does not compute the terms of this sequence, Joerg Arndt, Aug 17 2015 *)
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++ ];
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
base,nonn,less,uned,obsc
|
|
|
AUTHOR
|
Luke Andrew Marsh (luke(AT)lamarsh.org.uk), Sep 19 2008
|
|
|
STATUS
|
approved
|
| |
|
|
