|
|
A159619
|
|
Slowest increasing sequence beginning with 4 such that n and a(n) are either both evil or both odious.
|
|
10
|
|
|
4, 7, 9, 11, 12, 15, 16, 19, 20, 23, 25, 27, 28, 31, 33, 35, 36, 39, 41, 43, 44, 47, 48, 51, 52, 55, 57, 59, 60, 63, 64, 67, 68, 71, 73, 75, 76, 79, 80, 83, 84, 87, 89, 91, 92, 95, 97, 99, 100, 103, 105, 107, 108, 111, 112, 115, 116, 119, 121, 123, 124, 127, 129, 131, 132, 135, 137
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
(i) Theorem: For every initial value a(1) > 4, a minimum index n exists such that the a(n) obtained from that initial value coincides with this sequence here. Thus there exist essentially two slowest increasing sequences with this type of evil/odious congruence: A159615 and this one here.
(ii) In connection with this theorem, one can generalize to slowest increasing sequences a_m(n), a_m(1)=m, which let n and a(n) be at the same time in or not in some increasing sequence c(n). (This sequence here is c = A000069, m=4.)
We define a rank r of c as the minimum value a_r(1) such that for sufficiently large n (n depending on m) all sequences a_m(n), m>r, coincide with a_r(n).
In particular, c(n)=A004760(n+1) has rank r=2, and A000069 has rank r=3.
The problems are: 1) to find a sequence of rank r >= 4; 2) to find the rank of primes or to prove that it does not exist (in case of which it could be defined as infinity).
There is a conjecture arising in Sequence Machine that a(n) = A026491(2+n)-1. This appears to be true: Here we start from on odious or evil number and apply a minimum number of van-Eck-Transforms (of A171898) to reach a value larger than a(n-1). The Dekking formula in A026491 says that A026491 is essentially a partial sum of the backward van-Eck-Transforms, and in a (vague) manner this seems to match.
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 2n+3 if n*A007814(n+1) is even, and a(n) = 2n+2 otherwise.
|
|
MAPLE
|
read("transforms") ; isA000069 := proc(n) option remember ; RETURN( type(wt(n), 'odd') ) ; end:
A159619 := proc(n) option remember; if n = 1 then 4; else for a from procname(n-1)+1 do if isA000069(a) = isA000069(n) then RETURN(a) ; fi; od: fi; end:
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|