|
%I #12 Mar 06 2016 16:25:07
%S 1,2,5,7,4,11,13,10,17,19,14,23,25,8,29,31,22,35,37,26,41,43,20,47,49,
%T 34,53,55,38,59,61,28,65,67,46,71,73,50,77,79,16,83,85,58,89,91,62,95,
%U 97,44,101,103,70,107,109,74,113,115,52,119,121,82,125,127,86,131,133
%N Odd numbers with replacement of all prime factors 3 by 2.
%C This sequence occurred in an analysis of A098003, see link.
%H Ivan Neretin, <a href="/A098486/b098486.txt">Table of n, a(n) for n = 1..10000</a>
%H Keith Ramsay, <a href="http://groups.google.com/group/sci.math/msg/d11ac58ab66884ed">Recursively Rotated Permutation.</a> Posting in newsgroup sci.math, Sep 10 2004
%e a(8): The 8th odd number is 15=3*5. Replace factor 3 by 2: a(8)=2*5=10.
%t Table[(2 n - 1)*(2/3)^IntegerExponent[2 n - 1, 3], {n, 67}] (* _Ivan Neretin_, Mar 05 2016 *)
%o (PARI) lista(nn) = {forstep(n=1, nn, 2, newn = if (np = valuation(n, 3), n*2^np/3^np, n); print1(newn, ", "););} \\ _Michel Marcus_, Mar 06 2016
%Y Cf. A098003, A005408.
%K easy,nonn
%O 1,2
%A _Hugo Pfoertner_, Sep 10 2004
|
