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.

A076090 a(1) = 1; for n > 1, smallest number > 1 which is the n-th power of the sum of its digits, or 0 if no such number exists.

This page as a plain text file.
%I A076090 #9 Dec 05 2013 19:55:46
%S A076090 1,81,512,2401,17210368,34012224,612220032,20047612231936,
%T A076090 3904305912313344,13744803133596058624,8007313507497959524352,
%U A076090 2518170116818978404827136,81920000000000000
%N A076090 a(1) = 1; for n > 1, smallest number > 1 which is the n-th power of the sum of its digits, or 0 if no such number exists.
%D A076090 Amarnath Murthy, The largest and the smallest m-th power whose digits sum /product is its m-th root. To appear in Smarandache Notions Journal.
%D A076090 Amarnath Murthy, e-book, " Ideas on Smarandache Notions " MS.LIT
%F A076090 For n > 1, a(n) = A046017(n)^n. - _David Wasserman_, Mar 25 2005
%F A076090 a(n)=A072408(n), n>1. [From _R. J. Mathar_, Sep 23 2008]
%e A076090 a(3) = 512 = 8^3 and no smaller number (>1) can have this property. (This has been established in the reference.)
%Y A076090 Cf. A046017.
%K A076090 nonn,base
%O A076090 1,2
%A A076090 _Amarnath Murthy_, Oct 07 2002
%E A076090 More terms from _David Wasserman_, Mar 25 2005