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.

A374734 a(n) = a(n-1) + rotate(a(n-1), n-1 digits left) with a(1) = 1.

This page as a plain text file.
%I A374734 #23 Nov 08 2024 16:01:48
%S A374734 1,2,4,8,16,77,154,695,1264,3905,4444,8888,17776,93953,133348,481481,
%T A374734 1296295,7591424,11839015,50854133,92189218,114081407,928152547,
%U A374734 1182945362,10636566544,47203110650,78309615370,139846693679,606783485077,955291245755,1201047201046
%N A374734 a(n) = a(n-1) + rotate(a(n-1), n-1 digits left) with a(1) = 1.
%H A374734 Harvey P. Dale, <a href="/A374734/b374734.txt">Table of n, a(n) for n = 1..1000</a>
%e A374734 Here we use -m (where m > 0) to represent rotating the digits of a number m digits to the left.
%e A374734 a(9) = a(8) + rotate(a(8), -8) = 695 + rotate(695, -8) = 695 + 569 = 1264.
%t A374734 a[1] = 1; a[n_] := a[n] = a[n - 1] + FromDigits@RotateLeft[IntegerDigits[a[n - 1]], n - 1]; arr = a[#] & /@ Range[1, 100]
%t A374734 nxt[{n_,a_}]:={n+1,a+FromDigits[RotateLeft[IntegerDigits[a],n]]}; NestList[nxt,{1,1},30][[;;,2]] (* _Harvey P. Dale_, Nov 08 2024 *)
%Y A374734 Cf. A001127, A051300, A051299, A374731, A374732, A374733.
%K A374734 nonn,base,easy
%O A374734 1,2
%A A374734 _Nicholas M. R. Frieler_, Jul 17 2024