A096973 -id:A096973 - cp's OEIS frontend

A091566 Start with 10000 = DIX MILLE in French; to get the next term, replace each single letter with its equivalent Roman number if there is one; read the new number in French and repeat.

10000, 500110100015050, 1001100150501100500110050011010001505015001001000115050111000150501001

Offset: 1

Pierre CAMI, Aug 19 2004

The Pfeiffer reference in the links section has nothing to do with this sequence. The A-number, A091566 for this sequence is given in the reference but it is a typo. The reference is relevant to A085628. - Geoffrey Critzer, Jul 28 2014

G. Pfeiffer, Counting Transitive Relations, Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.2.

Cf. A096968, A096973.

A095992 a(1) = 30; for n > 1, a(n+1) = a(n) + {product of nonzero digits of a(n)}.

Original entry on oeis.org

30, 33, 42, 50, 55, 80, 88, 152, 162, 174, 202, 206, 218, 234, 258, 338, 410, 414, 430, 442, 474, 586, 826, 922, 958, 1318, 1342, 1366, 1474, 1586, 1826, 1922, 1958, 2318, 2366, 2582, 2742, 2854, 3174, 3258, 3498, 4362, 4506, 4626, 4914, 5058, 5258, 5658

Offset: 1

Julien Piquet (julipiquet(AT)yahoo.fr), Jul 18 2004

From a puzzle; explanation found by Pierre Roger.

Frank Rubin, Number Series

Cf. A063108, A096347, A096972, A063108, A063425, A096922, A096923, A096924, A096925, A096926, A096927, A096928, A096929, A096930, A096931, A096973, A096987.

a[1] = 30; a[n_] := a[n] = Block[{s = Sort[ IntegerDigits[a[n - 1]]]}, While[ s[[1]] == 0, s = Drop[s, 1]]; a[n - 1] + Times @@ s]; Table[ a[n], {n, 50}]
nxt[n_] := n+Times@@Select[IntegerDigits[n], #>0&]; NestList[nxt,30,50] (* Harvey P. Dale, Jan 08 2011 *)

The proposer suggests that this web site may contain other sequences also.

Edited and extended by Robert G. Wilson v and Klaus Brockhaus, Jul 20 2004

cp's OEIS Frontend

A091566 Start with 10000 = DIX MILLE in French; to get the next term, replace each single letter with its equivalent Roman number if there is one; read the new number in French and repeat.

Views

Author

Keywords

Comments

Links

Crossrefs

A095992 a(1) = 30; for n > 1, a(n+1) = a(n) + {product of nonzero digits of a(n)}.

Views

Author

Keywords

References

Links

Crossrefs

Programs

Mathematica

Extensions