login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022499 Describe the previous term! (method B - initial term is 3). 9
3, 31, 3111, 3113, 311231, 3112213111, 311222113113, 31122312311231, 3112223111213112213111, 31122331132111311222113113, 311222321231211331122312311231 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

COMMENTS

Method B = 'digit'-indication followed by 'frequency'.

LINKS

Table of n, a(n) for n=0..10.

EXAMPLE

E.g. the term after 3113 is obtained by saying "3 once, 1 twice, 3 once", which gives 311231.

MATHEMATICA

a[0] = 3;

a[n_] := a[n] = {#[[1]], Length[#]}& /@ Split[a[n-1] // IntegerDigits] // Flatten // FromDigits;

Array[a, 11, 0] (* Jean-Fran├žois Alcover, Jul 13 2016 *)

CROSSREFS

Cf. A007651, A022470, A022500-A022505.

Sequence in context: A172645 A201604 A048562 * A129209 A134721 A002707

Adjacent sequences:  A022496 A022497 A022498 * A022500 A022501 A022502

KEYWORD

nonn,base,easy,nice

AUTHOR

N. J. A. Sloane.

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 09:03 EST 2016. Contains 278906 sequences.