|
Search: id:A109648
|
|
|
| A109648 |
|
Sequence is its own ASCII representation (including commas and spaces). |
|
+0
5
|
|
| 53, 51, 44, 32, 53, 49, 44, 32, 52, 52, 44, 32, 51, 50, 44, 32, 53, 51, 44, 32, 52, 57, 44, 32, 52, 52, 44, 32, 51, 50, 44, 32, 53, 50, 44, 32, 53, 50, 44, 32, 52, 52, 44, 32, 51, 50, 44, 32, 53, 49, 44, 32, 53, 48, 44, 32, 52, 52, 44, 32, 51, 50, 44, 32, 53, 51, 44, 32, 53
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Only possible values are 32, 44, 48, 49, 50, 51, 52, 53, 54, 55, 56 and 57 which make their first appearance at n: 3, 2, 53, 5, 13, 1, 8, 0, 853, 85, 213, 21. - Robert G. Wilson v May 02 2006.
|
|
FORMULA
|
a(4n) = 48 + floor( a(n)/10 ), a(4n+1) = 48 + remainder( a(n)/10 ), a(4n+2) = 44, a(4n+3) = 32.
|
|
EXAMPLE
|
a(0) = 53 = 0x35 --> '5'
a(1) = 51 = 0x33 --> '3'
a(2) = 44 = 0x2C --> ','
a(3) = 32 = 0x20 --> ' '
a(4) = 53 = 0x35 --> '5'
a(5) = 49 = 0x33 --> '1'
a(6) = 44 = 0x2C --> ','
|
|
MATHEMATICA
|
a[0] = 53; a[1] = 51; a[n_] := Switch[Mod[n, 4], 0, 48 + Floor[a[n/4]/10], 1, 48 + Mod[a[(n - 1)/4], 10], 2, 44, 3, 32]; Table[a[n], {n, 0, 68}] (from Robert G. Wilson v (rgwv(at)rgwv.com), May 02 2006)
|
|
CROSSREFS
|
Cf. A109733 is another version.
Sequence in context: A048606 A033373 A104936 this_sequence A109733 A094462 A042403
Adjacent sequences: A109645 A109646 A109647 this_sequence A109649 A109650 A109651
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Andrew Weimholt (andrew(AT)weimholt.com), Aug 05 2005
|
|
|
Search completed in 0.002 seconds
|
