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”).
%I #6 Jul 13 2013 12:04:34
%S 1,3,7,9,15,19,25,31,33,39,51,57,63,67,73,79,97,103,115,121,127,129,
%T 135,147,153,159,195,201,207,225,231,243,249,255,259,265,271,289,295,
%U 307,313,319,385,391,403,409,415,451,457,463,481,487,499,505,511,513
%N Odd terms in A060142.
%C a(n) = A060142(A026351(n));
%C a(n+1) - a(n) = 2 * A219609(n).
%H Reinhard Zumkeller, <a href="/A219608/b219608.txt">Table of n, a(n) for n = 1..10000</a>
%o (Haskell)
%o a219608 n = a219608_list !! (n-1)
%o a219608_list = filter odd a060142_list
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Nov 26 2012