|
| |
|
|
A006942
|
|
Number of segments needed to represent n on calculator display.
(Formerly M4049)
|
|
5
| |
|
|
6, 2, 5, 5, 4, 5, 6, 3, 7, 6, 8, 4, 7, 7, 6, 7, 8, 5, 9, 8, 11, 7, 10, 10, 9, 10, 11, 8, 12, 11, 11, 7, 10, 10, 9, 10, 11, 8, 12, 11, 10, 6, 9, 9, 8, 9, 10, 7, 11, 10, 11, 7, 10, 10, 9, 10, 11, 8, 12, 11, 12, 8, 11, 11, 10, 11, 12, 9, 13, 12, 9, 5, 8, 8, 7, 8, 9
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
REFERENCES
| Netnews group rec.puzzles, Frequently Asked Questions (FAQ) file. (Science Section).
Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 65.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| Nathaniel Johnston, Table of n, a(n) for n = 0..10000
Matthew M. Conroy, Home page (listed instead of email address)
|
|
|
EXAMPLE
| Zero is _ (roughly), so a(0)=6.
....... | |
....... |_|
|
|
|
MAPLE
| A006942 := proc(n) local d, dig, j, s: if(n=0)then return 6:fi: dig:=[6, 2, 5, 5, 4, 5, 6, 3, 7, 6]: d:=convert(n, base, 10): s:=0: for j from 1 to nops(d) do s:=s+dig[d[j]+1]: od: return s: end: seq(A006942(n), n=0..100); # Nathaniel Johnston, May 08 2011
|
|
|
CROSSREFS
| For other versions of this sequence see A010371 A018846 A018847 A018849 A038136 A053701 A063720.
Sequence in context: A062828 A124457 A063720 * A074458 A010371 A011489
Adjacent sequences: A006939 A006940 A006941 * A006943 A006944 A006945
|
|
|
KEYWORD
| base,nonn,nice,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Matthew M. Conroy, Sep 13 2001
|
| |
|
|
