This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A069935 #15 Sep 21 2024 08:41:57 %S A069935 1,1,2,1,1,1,1,1,2,2,2,8,1,1,1,16,1,1,1,2,1,8,2,1,1,2,4,2,2,1,4,2,1,1, %T A069935 2,1,1,1,1,1,2,1,2,1,1,2,2,2,1,1,2,1,1,1,1,4,1,2,4,4,1,1,4,1,2,2,64,1, %U A069935 1,1,32,1,1,1,4,8,1,1,4,2,4,1,1,1,4,1,2,1,1,1,1,1,1,1,8,1,2048,2,8,1,4,2,1,2,1,1,16,1 %N A069935 Maximal power of 2 that divides the n-th partition number. %H A069935 Amiram Eldar, <a href="/A069935/b069935.txt">Table of n, a(n) for n = 0..10000</a> %F A069935 From _Amiram Eldar_, May 25 2024: (Start) %F A069935 a(n) = A006519(A000041(n)). %F A069935 a(n) = 2^A278478(n). (End) %t A069935 a[n_] := 2^IntegerExponent[PartitionsP[n], 2]; Array[a, 100, 0] (* _Amiram Eldar_, May 25 2024 *) %o A069935 (PARI) for(n=0,10^3,my(p=numbpart(n));print1(2^valuation(p,2),", ")); \\ _Joerg Arndt_, May 09 2013 %Y A069935 Cf. A000041, A006519, A278478. %K A069935 nonn %O A069935 0,3 %A A069935 Sharon Sela (sharonsela(AT)hotmail.com), May 04 2002 %E A069935 More terms from _John W. Layman_, May 09 2002