|
Search: id:A004770
|
|
|
| A004770 |
|
Numbers of form 8n+5; or, numbers whose binary expansion ends 101. |
|
+0
6
|
|
| 5, 13, 21, 29, 37, 45, 53, 61, 69, 77, 85, 93, 101, 109, 117, 125, 133, 141, 149, 157, 165, 173, 181, 189, 197, 205, 213, 221, 229, 237, 245, 253, 261, 269, 277, 285, 293, 301, 309, 317, 325, 333, 341, 349, 357, 365, 373, 381, 389, 397, 405, 413
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Only numbers of the form 8n+5 may be written as a sum of 5 odd squares. Examples: 5 = 1+1+1+1+1, 13 = 9+1+1+1+1, 21 = 9+9+1+1+1, 29 = 25+1+1+1+1= 9+9+9+1+1, 37 = 9+9+9+9+1 = 25+9+1+1+1, 45 = 25+9+9+1+1=9+9+9+9+9, 53 = 49+1+1+1+1 = 25+25+1+1+1 = 25+9+9+9+1, ... - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 03 2005
Positive solutions to the equation x == 5 (mod 8). [From Kailasam Viswanathan Iyer (kvi(AT)nitt.edu), Apr 27 2009]
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
PROGRAM
|
(Other) sage: [i+5 for i in range(413) if gcd(i, 8) == 8] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]
|
|
CROSSREFS
|
Cf. A110534.
Sequence in context: A030374 A007675 A043441 this_sequence A107996 A107997 A166095
Adjacent sequences: A004767 A004768 A004769 this_sequence A004771 A004772 A004773
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
