The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A079399 Number of dots in Braille representation of n. 6
 3, 1, 2, 2, 3, 2, 3, 4, 3, 2, 4, 2, 3, 3, 4, 3, 4, 5, 4, 3, 5, 3, 4, 4, 5, 4, 5, 6, 5, 4, 5, 3, 4, 4, 5, 4, 5, 6, 5, 4, 6, 4, 5, 5, 6, 5, 6, 7, 6, 5, 5, 3, 4, 4, 5, 4, 5, 6, 5, 4, 6, 4, 5, 5, 6, 5, 6, 7, 6, 5, 7, 5, 6, 6, 7, 6, 7, 8, 7, 6, 6, 4, 5, 5, 6, 5, 6, 7, 6, 5, 5, 3, 4, 4, 5, 4, 5, 6, 5, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS The number of dots in [0..9] is [3,1,2,2,3,2,3,4,3,2]. LINKS American Foundation for the Blind, Braille Bug American Printing House for the Blind, Braille: Deciphering the Code RNIB, This is Braille FORMULA a(n) = A000120(A121018(n)) = A000120(A121019(n)). - Reinhard Zumkeller, Jul 23 2006 EXAMPLE a(11) = 1+1 = 2. MATHEMATICA With[{br=Thread[Range[0, 9]->{3, 1, 2, 2, 3, 2, 3, 4, 3, 2}]}, Total/@ Table[ IntegerDigits[ n]/.br, {n, 0, 100}]] (* Harvey P. Dale, May 24 2013 *) PROG (PARI) { braille=[3, 1, 2, 2, 3, 2, 3, 4, 3, 2]; for (n=0, 99, b=braille[n%10+1]; if (n>9, b=b+braille[n\10+1]); print1(b", ")) } (Python) b = [3, 1, 2, 2, 3, 2, 3, 4, 3, 2] def a(n): return sum(b[d] for d in map(int, str(n))) print([a(n) for n in range(100)]) # Michael S. Branicky, Mar 01 2021 CROSSREFS See A072283 for another version. Cf. A079401, A079405. Cf. A000120, A121018, A121019. Sequence in context: A108121 A161916 A072548 * A092155 A288725 A029336 Adjacent sequences: A079396 A079397 A079398 * A079400 A079401 A079402 KEYWORD nonn AUTHOR Jon Perry, Feb 16 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 4 05:49 EST 2023. Contains 360046 sequences. (Running on oeis4.)