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.

Showing 1-2 of 2 results.

A113018 {Digital root of n} raised to the power {number of digits of n}.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 1, 4, 9, 16, 25, 36, 49, 64, 81, 1, 4, 9, 16, 25, 36, 49, 64, 81, 1, 4, 9, 16, 25, 36, 49, 64, 81, 1, 4, 9, 16, 25, 36, 49, 64, 81, 1, 4, 9, 16, 25, 36, 49, 64, 81, 1, 4, 9, 16, 25, 36, 49, 64, 81, 1, 4, 9, 16, 25, 36, 49, 64, 81, 1
Offset: 0

Views

Author

Alexandre Wajnberg, Jan 03 2006

Keywords

Comments

Fixed points are: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 and 81.

Examples

			a(9) = 9^1 = 9;
a(19) = (1 + 9 = 10 => 1 + 0) = 1^2 =  1;
a(85) = (8 + 5 = 13 => 1 + 3) = 4^2 = 16.
		

Crossrefs

Programs

  • Maple
    A113018 := proc(n) if(n=0)then return 0:fi: return (((n-1) mod 9) + 1)^length(n): end: seq(A113018(n), n=0..100); # Nathaniel Johnston, May 05 2011
  • Mathematica
    Join[{0},Table[ResourceFunction["AdditiveDigitalRoot"][n]^IntegerLength[n],{n,73}]] (* James C. McMahon, Jun 14 2024 *)

Formula

a(n) = A010888(n)^A055642(n). - Michel Marcus, Feb 10 2019

A329562 a(n) = 2^(sum of digits of n).

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 64, 128
Offset: 0

Views

Author

Seiichi Manyama, Nov 16 2019

Keywords

Comments

a(n) differs from A113019(n+9) starting at n = 19. - M. F. Hasler, Nov 17 2019

Crossrefs

Programs

  • PARI
    {a(n) = 2^sumdigits(n)}

Formula

a(n) = 2^A007953(n).
Showing 1-2 of 2 results.