Search: id:A022544 Results 1-1 of 1 results found. %I A022544 %S A022544 3,6,7,11,12,14,15,19,21,22,23,24,27,28,30,31,33,35,38,39,42,43,44,46, %T A022544 47,48,51,54,55,56,57,59,60,62,63,66,67,69,70,71,75,76,77,78,79,83,84, %U A022544 86,87,88,91,92,93,94,95,96,99,102,103,105,107,108,110,111,112,114,115, 118,119,120,123,124,126,127,129,131,132,133,134,135,138,139,140,141, 142,143,147,150,151,152,154,155,156,158,159,161,163,165,166,167,168, 171,172,174,175,176,177,179,182,183,184,186,187,188,189,190,191,192, 195,198,199 %N A022544 Numbers that are not the sum of 2 squares. %C A022544 Conjecture: if n is not the sum of 2 squares sigma(n)==0 mod 4 (the converse does not hold). - Benoit Cloitre (benoit7848c(AT)orange.fr), May 19 2002 %C A022544 lim n->inf a(n)/n = 1. %D A022544 S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 98-104. %H A022544 T. D. Noe, Table of n, a(n) for n=1..10000 %H A022544 S. R. Finch, Landau-Ramanujan Constant %H A022544 Index entries for sequences related to sums of squares %F A022544 Numbers having some prime factor p == 3 (mod 4) to an odd power. sigma(n) == 0 (mod 4) because of this prime factor. Every n == 3 (mod 4) is an element. First differences are always 1, 2, 3 or 4, each occurring infinitely often. - David W. Wilson (davidwwilson(AT)comcast.net), Mar 09 2005 %o A022544 (PARI) for(n=0,200,if(sum(i=0,n,sum(j=0,i,if(i^2+j^2-n,0,1)))==0,print1((n), ","))) %Y A022544 Complement of A001481. %Y A022544 Sequence in context: A136272 A101184 A087643 this_sequence A091067 A120511 A022550 %Y A022544 Adjacent sequences: A022541 A022542 A022543 this_sequence A022545 A022546 A022547 %K A022544 nonn,nice %O A022544 1,1 %A A022544 N. J. A. Sloane (njas(AT)research.att.com). %E A022544 More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), May 19 2002 Search completed in 0.002 seconds