Search: id:A034178 Results 1-1 of 1 results found. %I A034178 %S A034178 1,0,1,1,1,0,1,1,2,0,1,1,1,0,2,2,1,0,1,1,2,0,1,2,2,0,2,1,1,0,1,2,2,0,2, %T A034178 2,1,0,2,2,1,0,1,1,3,0,1,3,2,0,2,1,1,0,2,2,2,0,1,2,1,0,3,3,2,0,1,1,2,0, %U A034178 1,3,1,0,3,1,2,0,1,3,3,0,1,2,2,0,2,2,1,0,2,1,2,0,2,4,1,0,3 %N A034178 Number of solutions to n = a^2-b^2, a>b>=0. %C A034178 Also, number of ways n can be expressed as the sum of consecutive odd numbers.(e.g. 45 = 45 = 13+15+17 = 5+7+9+11+13, so a(45)=3). - Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 26 2002 %C A034178 a(A042965(n))>0, a(A016825(n))=0; also number of occurrences of n in A094728. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 24 2004 %H A034178 T. D. Noe, Table of n, a(n) for n=1..2000 %F A034178 a(2k) = A038548(2k)-A001227(k). a(2k+1) = A038548(2k+1). - Naohiro Nomoto (n_nomoto(AT)yabumi.com), Feb 26 2002 %Y A034178 Cf. A058957, A016825. %Y A034178 Sequence in context: A110475 A086971 A088434 this_sequence A131341 A074169 A099362 %Y A034178 Adjacent sequences: A034175 A034176 A034177 this_sequence A034179 A034180 A034181 %K A034178 easy,nonn,nice %O A034178 1,9 %A A034178 Erich Friedman (erich.friedman(AT)stetson.edu) Search completed in 0.129 seconds