|
Search: id:A109733
|
|
|
| A109733 |
|
Sequence (written here in base 10) is its own ASCII representation. |
|
+0
4
|
|
| 53, 51, 53, 49, 53, 51, 52, 57, 53, 51, 53, 49, 53, 50, 53, 55, 53, 51, 53, 49, 53, 51, 52, 57, 53, 51, 53, 48, 53, 51, 53, 53, 53, 51, 53, 49, 53, 51, 52, 57, 53, 51, 53, 49, 53, 50, 53, 55, 53, 51, 53, 49, 53, 51, 52, 56, 53, 51, 53, 49, 53, 51, 53, 51, 53, 51, 53, 49, 53
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
The octal version of this idea is simply 66,66,66,66,.., not interesting.
|
|
FORMULA
|
I conjecture that a(n) = 53 when n is congruent to 1, 3 or 5 (mod 8), and a(n) = 51 when n is congruent to 2 (mod 8). - Jonathan Cross (jcross(AT)juggler.net), Oct 14 2005
|
|
EXAMPLE
|
a(1) = 53 (decimal) = 65 (octal) => '5',
a(2) = 51 (decimal) = 63 (octal) => '3',
a(3) = 53 (decimal) = 65 (octal) => '5',
a(4) = 49 (decimal) = 61 (octal) => '1', etc.
|
|
CROSSREFS
|
Cf. A109648.
Adjacent sequences: A109730 A109731 A109732 this_sequence A109734 A109735 A109736
Sequence in context: A033373 A104936 A109648 this_sequence A094462 A042403 A095549
|
|
KEYWORD
|
easy,nonn,base
|
|
AUTHOR
|
njas and Nadia Heninger (nadiah(AT)cs.princeton.edu), Aug 10 2005
|
|
EXTENSIONS
|
More terms from Jonathan Cross (jcross(AT)juggler.net), Oct 14 2005
|
|
|
Search completed in 0.002 seconds
|
