|
%I #8 Mar 16 2022 21:02:14
%S 2,42,56,110,182,342,506,552,702,812,930,992,1190,1332,1640,1722,2162,
%T 2450,2756,2862,2970,3080,3306,3540,3782,4422,4692,4970,5700,6006,
%U 6320,6480,6806,7310,7832,8372,8742,9120,9506,9900
%N Odious oblong (promic) numbers.
%H Amiram Eldar, <a href="/A130201/b130201.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = 2*A130202(n). Multiplication by 2 preserves odiousness, hence this sequence is twice odious triangular numbers.
%t Select[Table[n(n + 1), {n, 100}], OddQ[Plus @@ IntegerDigits[ #, 2]] &]
%o (PARI) is(n)=n%2==0 && hammingweight(n)%2 && ispolygonal(n/2,3) \\ _Charles R Greathouse IV_, Mar 16 2022
%Y Cf. This sequence is the intersection of odious (A000069) and oblong (A002378) numbers.
%K nonn,easy
%O 1,1
%A _Tanya Khovanova_, May 16 2007
%E Offset corrected by _Amiram Eldar_, Dec 09 2019
|
