The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152754 "Upper positive integers": n is in the sequence iff in the representation n=A000695(k)+2*A000695(l) satisfies inequality A000695(k) < A000695(l) 4
 2, 8, 9, 10, 11, 14, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 50, 56, 57, 58, 59, 62, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS In the mapping: every integer m corresponds to a unique pair (k,l) with m=A000695(k)+2*A000695(l) (k=A059905(m), l=A059906(m)), the numbers a(n) are mapped into the lattice points lying upper the diagonal l=k. If the binary expansion of N is Sum b_j*2^j, then N is in the sequence iff Sum b_(2j)*2^j=2, 1, 0]]; half[n_, h_ ] := Module[{t=1, s=0, m=n}, While[m>0, s += fh[m, h]*t; m=Quotient[m, 4]; t *= 2]; s]; mb[n_] := FromDigits[Riffle[IntegerDigits[n, 2], 0], 2]; aQ[n_] := mb[half[n, 1]] < mb[half[n, 2]]; Select[Range[160], aQ] (* Amiram Eldar, Dec 16 2018 from the PARI code *) PROG (PARI) a000695(n) = fromdigits(binary(n), 4); half1(n) = { my(t=1, s=0); while(n>0, s += (n%2)*t; n \= 4; t *= 2); (s); }; \\ A059905 half2(n) = { my(t=1, s=0); while(n>0, s += ((n%4)>=2)*t; n \= 4; t *= 2); (s); }; \\ A059906 isok(n) = a000695(half1(n)) < a000695(half2(n)); \\ Michel Marcus, Dec 15 2018 CROSSREFS Cf. A000695, A139370. Sequence in context: A043059 A237415 A247635 * A001560 A175463 A167450 Adjacent sequences:  A152751 A152752 A152753 * A152755 A152756 A152757 KEYWORD nonn AUTHOR Vladimir Shevelev, Dec 12 2008 EXTENSIONS Missing 9 and more terms from Michel Marcus, Dec 15 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 20 19:33 EDT 2021. Contains 343137 sequences. (Running on oeis4.)