The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A171959 a(1) = 0, for n >= 2; a(n) = the smallest number h such that tau(h) = A000005(h) = a(n-1) + 3. 9

%I #4 Apr 22 2013 17:12:19

%S 0,4,64,73786976294838206464

%N a(1) = 0, for n >= 2; a(n) = the smallest number h such that tau(h) = A000005(h) = a(n-1) + 3.

%C a(5) = 2^44210291368986342 * 3^1668 is too large to include.

%F A000005(a(n)) = a(n-1) + 3 for n >= 2.

%F For n>1, a(n) = A005179(a(n-1) + 3).

%Y Cf. A014221, A173603, A173604, A173605, A173606, A173607, A173608, A173609, A173011.

%K nonn

%O 1,2

%A _Jaroslav Krizek_, Nov 06 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 11 10:58 EDT 2024. Contains 373311 sequences. (Running on oeis4.)