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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022520 Describe previous term from the right (method B - initial term is 9). 9
9, 91, 1191, 119112, 21129112, 211291211221, 112212211191211221, 1122122111911322112212, 21112212223112911322112212, 21112212223112912112312311221321 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
Method B = 'digit'-indication followed by 'frequency'.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 0..21
EXAMPLE
The term after 1191 is obtained by saying "1 once, 9 once, 1 twice", which gives 119112.
PROG
(Haskell)
import Data.List (group, transpose)
a022520 n = a022520_list !! n
a022520_list = 9 : f [9] :: [Integer] where
f xs = (read $ concatMap show ys) : f ys where
ys = concat $ transpose [map head zss, map length zss]
zss = reverse $ group xs
-- Reinhard Zumkeller, Jan 26 2014
CROSSREFS
Sequence in context: A176735 A286786 A123792 * A020236 A068624 A034666
KEYWORD
nonn,base,easy,nice
AUTHOR
EXTENSIONS
More terms from Patrick De Geest, Jun 15 1999
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)