|
Search: id:A017185
|
|
| |
|
| 2, 11, 20, 29, 38, 47, 56, 65, 74, 83, 92, 101, 110, 119, 128, 137, 146, 155, 164, 173, 182, 191, 200, 209, 218, 227, 236, 245, 254, 263, 272, 281, 290, 299, 308, 317, 326, 335, 344, 353, 362, 371, 380, 389, 398, 407, 416, 425, 434, 443, 452, 461, 470, 479
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Numbers whose digital root is 2. - Cino Hilliard (hillcino368(AT)hotmail.com), Dec 26 2006
|
|
LINKS
|
Tanya Khovanova, Recursive Sequences
|
|
PROGRAM
|
(PARI) twosome(n) = { local(x, ln, j, f); for(x=1, n, f=0; ln=length(Str(x)); if(droot(x)==2, print1(x", ")); ) } droot(n) = \ the digital root of a number. { local(x); x= n%9; if(x>0, return(x), return(9)) } - Cino Hilliard (hillcino368(AT)hotmail.com), Dec 26 2006
(Other) sage: [i+2 for i in range(480) if gcd(i, 9) == 9] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]
|
|
CROSSREFS
|
Sequence in context: A105076 A067670 A159879 this_sequence A092595 A116990 A146087
Adjacent sequences: A017182 A017183 A017184 this_sequence A017186 A017187 A017188
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Cino Hilliard (hillcino368(AT)hotmail.com), Dec 26 2006
|
|
|
Search completed in 0.002 seconds
|
