login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A268673
a(0) = 0; a(1) = 1; for n > 1, a(n) = 1 + 4*A092246(n-1).
2
0, 1, 5, 29, 45, 53, 77, 85, 101, 125, 141, 149, 165, 189, 197, 221, 237, 245, 269, 277, 293, 317, 325, 349, 365, 373, 389, 413, 429, 437, 461, 469, 485, 509, 525, 533, 549, 573, 581, 605, 621, 629, 645, 669, 685, 693, 717, 725, 741, 765, 773, 797, 813, 821, 845, 853, 869, 893, 909, 917, 933, 957, 965, 989, 1005
OFFSET
0,3
COMMENTS
Seems to be also the fixed points of permutations A268823 and A268824.
LINKS
FORMULA
a(0) = 0; a(1) = 1; for n > 1, a(n) = 1 + 4*A092246(n-1).
MATHEMATICA
Join[{0, 1}, 1 + 4 Select[Range[1, 251, 2], OddQ[Total[IntegerDigits[#, 2]]]&]] (* Jean-François Alcover, Mar 15 2016 *)
PROG
(Scheme)
(define (A268673 n) (if (<= n 1) n (+ 1 (* 4 (A092246 (- n 1))))))
(Python)
def A268673(n): return (((m:=n-2)<<4)+(13 if m.bit_count()&1 else 5)) if n>1 else n # Chai Wah Wu, Mar 03 2023
CROSSREFS
Cf. also A092246, A268717.
Many (but not all) terms of A013710 seem to be included.
Sequence in context: A156053 A081116 A192090 * A146829 A329151 A201712
KEYWORD
nonn
AUTHOR
Antti Karttunen, Feb 19 2016
STATUS
approved