|
| |
|
|
A160590
|
|
Next-to-least significant digit of 2^n.
|
|
0
| |
|
|
1, 3, 6, 2, 5, 1, 2, 4, 9, 9, 8, 6, 3, 7, 4, 8, 7, 5, 0, 0, 1, 3, 6, 2, 5, 1, 2, 4, 9, 9, 8, 6, 3, 7, 4, 8, 7, 5, 0, 0, 1, 3, 6, 2, 5, 1, 2, 4, 9, 9, 8, 6, 3, 7, 4, 8, 7, 5, 0, 0, 1, 3, 6, 2, 5, 1, 2, 4, 9, 9, 8, 6, 3, 7, 4, 8, 7, 5, 0, 0, 1, 3, 6, 2, 5, 1, 2, 4, 9, 9, 8, 6, 3, 7, 4, 8, 7, 5, 0, 0, 1, 3, 6, 2, 5
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 4,2
|
|
|
COMMENTS
| In the sequence [1, 2, 4, 8,] 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, (A000079)
the least-significant digit recurs as [..], 6,2,4,8.. (A000689).
The second-least-significant digit repeats in the sequence [..],1,3,6,2,5,1,2,4,9,9,8,6,3,7,4,8,7,5,0,0...
|
|
|
LINKS
| M. Haapanen, What is this and how to prove?, newgroups sci.math, Mar 28 1996
K. Makella, Mika luku tulee seuraavana?, sfnet.tiede.matematiikka, Jan 2008
Lars Radvall, Multiplar (PDF).
|
|
|
FORMULA
| Periodic: a(n+20)=a(n).
|
|
|
MAPLE
| for n from 4 to 130 do 2 &^ n mod 100 ; printf("%d, ", floor(%/10)) ; od:
|
|
|
CROSSREFS
| Sequence in context: A200474 A154858 A169837 * A111952 A068466 A194076
Adjacent sequences: A160587 A160588 A160589 * A160591 A160592 A160593
|
|
|
KEYWORD
| nonn,base
|
|
|
AUTHOR
| Brian Tristam Williams (briantw(AT)briantw.com), May 20 2009
|
|
|
EXTENSIONS
| Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 22 2009
|
| |
|
|
