cp's OEIS Frontend

A335283 a(n) = 1 + Sum_{d|n, n/d odd, d < n} a(d).

%I A335283 #11 Dec 10 2021 11:38:29
%S A335283 1,1,2,1,2,2,2,1,4,2,2,2,2,2,6,1,2,4,2,2,6,2,2,2,4,2,8,2,2,6,2,1,6,2,
%T A335283 6,4,2,2,6,2,2,6,2,2,16,2,2,2,4,4,6,2,2,8,6,2,6,2,2,6,2,2,16,1,6,6,2,
%U A335283 2,6,6,2,4,2,2,16,2,6,6,2,2,16,2,2,6,6,2,6,2,2,16,6,2,6,2,6,2,2,4,16,4,2,6,2,2,26
%N A335283 a(n) = 1 + Sum_{d|n, n/d odd, d < n} a(d).
%H A335283 Antti Karttunen, <a href="/A335283/b335283.txt">Table of n, a(n) for n = 1..20000</a>
%F A335283 G.f. A(x) satisfies: A(x) = x / (1 - x) + Sum_{k>=2} A(x^(2*k-1)).
%F A335283 G.f.: x / (1 - x) + Sum_{n>=1} a(n) * x^(3*n) / (1 - x^(2*n)).
%F A335283 a(1) = 1; a(2*n) = a(n), a(2*n+1) = 2 * A074206(2*n+1).
%t A335283 a[n_] := 1 + Sum[If[d < n && OddQ[n/d], a[d], 0], {d, Divisors[n]}]; Table[a[n], {n, 85}]
%t A335283 terms = 85; A[_] = 0; Do[A[x_] = x/(1 - x) + Sum[A[x^(2 k - 1)], {k, 2, terms}] + O[x]^(terms + 1) // Normal, terms + 1]; CoefficientList[A[x], x] // Rest
%o A335283 (PARI)
%o A335283 up_to = 20000;
%o A335283 A335283lista(up_to) = {my(v = vector(up_to)); for(n=1, up_to, v[n] = 1 + sumdiv(n, d, if(d<n&&((n/d)%2), v[d], 0))); (v); };
%o A335283 v335283 = A335283lista(up_to);
%o A335283 A335283(n) = v335283[n]; \\ _Antti Karttunen_, Dec 09 2021
%Y A335283 Cf. A000079 (positions of 1's), A038550 (positions of 2's), A067824, A074206, A209229, A307779, A335062.
%K A335283 nonn
%O A335283 1,3
%A A335283 _Ilya Gutkovskiy_, May 30 2020
%E A335283 More terms from _Antti Karttunen_, Dec 09 2021