The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036066 The summarize Lucas sequence: summarize the previous two terms, start with 1, 3. 3
 1, 3, 1311, 2331, 331241, 14432231, 34433241, 54533231, 2544632221, 163534435221, 263544436231, 363554634231, 463554733221, 17364544733221, 37263554634231, 37363554734231, 37364544933221, 1937263554933221 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS After the 26th term the sequence goes into a cycle of 46 terms. "Summarize" uses here method C = A244112: in order of decreasing digit value. LINKS FORMULA a(n+1) = A244112(concat(a(n),a(n-1))). - M. F. Hasler, Feb 25 2018 MATHEMATICA a[0] = 1; a[1] = 3; a[n_] := a[n] = FromDigits @ Flatten @ Reverse @ Select[ Transpose @ { DigitCount[a[n-1]] + DigitCount[a[n-2]], Append[ Range[9], 0]}, #[[1]] > 0 &]; Table[a[n], {n, 0, 17}] (* Jean-François Alcover, Dec 30 2017 *) PROG (PARI) {a=[1, 3]; for(n=1, 50, a=concat(a, A244112(eval(Str(a[n], a[n+1]))))); a} \\ M. F. Hasler, Feb 25 2018 CROSSREFS Cf. A036059. Cf. A244112 (summarizing as used here: by decreasing digit value), A047842 (alternative summarizing method: by increasing digit value), A047843 (another method: don't omit missing digits between smallest and largest one). Sequence in context: A129078 A174826 A122389 * A262516 A060307 A119111 Adjacent sequences:  A036063 A036064 A036065 * A036067 A036068 A036069 KEYWORD base,easy,nice,nonn AUTHOR 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 25 05:01 EST 2020. Contains 332217 sequences. (Running on oeis4.)