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.

A133184 Let k'' be the result of applying the powertrain map of A133500 twice to k. Sequence gives conjectured list of all possible values of k''.

This page as a plain text file.
%I A133184 #5 Nov 04 2013 13:01:49
%S A133184 0,1,2,3,4,5,6,7,8,9,10,12,15,16,18,20,25,27,28,32,35,36,40,45,48,49,
%T A133184 50,54,56,64,72,80,81,96,98,125,128,140,144,160,162,180,192,196,200,
%U A133184 216,243,245,256,270,288,320,324,343,384,392,400,432,441,480,486
%N A133184 Let k'' be the result of applying the powertrain map of A133500 twice to k. Sequence gives conjectured list of all possible values of k''.
%C A133184 Sequence is believed to be finite.
%C A133184 All terms are members of A002473. Members of A002473 not present here are given in A133185. However, no proof is known that the missing numbers from A002473 (14, 21, 24, 30, ...) really are missing.
%C A133184 To settle this, one would, for example, have to prove that no number of the form 2^i*3^j*5^k*7^l exists with powertrain value 14.
%C A133184 The entries are based on a search of all numbers k such that k' = powertrain(k) <= 10^120.
%H A133184 N. J. A. Sloane, <a href="/A133184/b133184.txt">Table of n, a(n) for n = 1..10001</a>
%K A133184 nonn,base
%O A133184 1,3
%A A133184 _J. H. Conway_ and _N. J. A. Sloane_, Jan 01 2008