cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A248078 a(1) = 1; a(n+1) = a(n) + product of digits of a(n) + sum of digits of a(n).

Original entry on oeis.org

1, 3, 9, 27, 50, 55, 90, 99, 198, 288, 434, 493, 617, 673, 815, 869, 1324, 1358, 1495, 1694, 1930, 1943, 2068, 2084, 2098, 2117, 2142, 2167, 2267, 2452, 2545, 2761, 2861, 2974, 3500, 3508, 3524, 3658, 4400, 4408, 4424, 4566, 5307, 5322, 5394, 5955, 7104, 7116
Offset: 1

Views

Author

Gil Broussard, Sep 30 2014

Keywords

Comments

Unlike A063108, this sequence includes in its formula the digit 0 in the product of digits of a(n).

Examples

			Given a(5)=50, then a(6)=50+(5+0)+(5*0)=55.
		

Crossrefs

Programs

  • Maple
    f:= proc(x) local L;
      L:= convert(x,base,10);
      x + convert(L,`+`)+convert(L,`*`)
    end proc:
    A[1]:= 1:
    for n from 2 to 100 do A[n]:= f(A[n-1]) od:
    seq(A[i],i=1..100); # Robert Israel, Jun 25 2019
  • Mathematica
    NestList[#+Total[IntegerDigits[#]]+Times@@IntegerDigits[#]&,1,50] (* Harvey P. Dale, Sep 11 2019 *)
  • PARI
    lista(nn) = {prev = 1; print1(prev, ", "); for (n=1, nn, d = digits(prev); prev += sumdigits(prev) + prod(k=1, #d, d[k]); print1(prev, ", "););} \\ Michel Marcus, Oct 01 2014