The On-Line Encyclopedia of Integer Sequences (OEIS)

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

Revision History for A118628

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A118628

"Say what you see".
(history; published version)

#24 by Joerg Arndt at Sat Feb 24 01:16:00 EST 2024

STATUS

editing

approved

#23 by Paolo P. Lava at Fri Feb 23 16:09:37 EST 2024

MAPLE

P:=proc(q, h) local a, b, c, k, n, x; x:=[h]; for n from 1 to q do

a:=convert(x[n], base, 10); b:=0; for k from 0 to 9 do c:=numboccur(a, k);

if c>0 then b:=b*10^(ilog10(c*10+k)+1)+c*10+k; fi; od; x:=[op(x), b];

od; print(op(x)); end: P(25, 3); # Paolo P. Lava, Aug 30 2018

STATUS

approved

editing

#22 by Michel Marcus at Mon Jun 05 01:25:35 EDT 2023

STATUS

reviewed

approved

#21 by Joerg Arndt at Mon Jun 05 01:10:13 EDT 2023

STATUS

proposed

reviewed

#20 by Pontus von Brömssen at Sun Jun 04 16:26:46 EDT 2023

STATUS

editing

proposed

#19 by Pontus von Brömssen at Sun Jun 04 16:24:12 EDT 2023

COMMENTS

a(n) = 21322314 for n > 12; a(n) = A005151(n) for n > 6. - Reinhard Zumkeller, Jan 26 2014

FORMULA

a(n) = 21322314 for n > 12; a(n) = A005151(n) for n > 6. - Reinhard Zumkeller, Jan 26 2014

#18 by Pontus von Brömssen at Sun Jun 04 16:23:10 EDT 2023

DATA

3, 13, 1113, 3113, 2123, 112213, 312213, 212223, 114213, 31121314, 41122314, 31221324, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314, 21322314

FORMULA

a(n) = A047842(a(n-1)). - Pontus von Brömssen, Jun 04 2023

CROSSREFS

Cf. A045918, A047842, A023989.

STATUS

approved

editing

#17 by Bruno Berselli at Thu Aug 30 10:01:06 EDT 2018

STATUS

proposed

approved

#16 by Paolo P. Lava at Thu Aug 30 09:58:33 EDT 2018

STATUS

editing

proposed

#15 by Paolo P. Lava at Thu Aug 30 09:48:52 EDT 2018

MAPLE

P:=proc(q, h) local a, b, c, k, n, x; x:=[h]; for n from 1 to q do

a:=convert(x[n], base, 10); b:=0; for k from 0 to 9 do c:=numboccur(a, k);

if c>0 then b:=b*10^(ilog10(c*10+k)+1)+c*10+k; fi; od; x:=[op(x), b];

od; print(op(x)); end: P(25, 3); # Paolo P. Lava, Aug 30 2018

STATUS

approved

editing