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.

A093098 "Power into digits": start with a(1)=2, a(2)=3; repeatedly adjoin digits of a(n-2)^a(n-1).

Original entry on oeis.org

2, 3, 8, 6, 5, 6, 1, 2, 6, 2, 1, 4, 4, 7, 7, 7, 6, 1, 5, 6, 2, 5, 6, 1, 6, 4, 3, 6, 2, 1, 2, 5, 6, 1, 6, 3, 8, 4, 8, 2, 3, 5, 4, 3, 8, 2, 3, 5, 4, 3, 1, 1, 7, 6, 4, 9, 6, 1, 1, 5, 6, 2, 5, 3, 6, 3, 2, 1, 5, 6, 2, 5, 6, 1, 1, 2, 9, 6, 6, 4, 7, 2, 9, 3, 6, 2, 1, 3, 2, 1, 5, 6, 2, 5, 6, 1, 2, 1, 6, 6, 5, 6, 1, 4, 0
Offset: 1

Views

Author

Bodo Zinser, Mar 20 2004

Keywords

Comments

a(490) = a(491) = 0 and so the value of a(1306) is perhaps controversial. I have used the combinatorial definition 0^0 = 1 in my PARI script below. - Charles R Greathouse IV, Feb 15 2024

Examples

			a(3)=a(1)^a(2), a(4)=first digit of a(2)^a(3)=3^8=6561, a(5)=2nd digit of a(2)^a(3)=3^8=6561, a(6)=3rd digit of a(2)^a(3)=3^8=6561
		

Crossrefs

Programs