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.

A094150 Number of iterations of the sum of digits of the divisors of R(n) needed to reach 15, where R(n) = A002275.

This page as a plain text file.
%I A094150 #10 Jun 26 2025 14:52:45
%S A094150 5,13,12,3,11,10,15,3,14,3,5,18,13,4,18,18,5,2,4,3,12,10,21,12,18,16,
%T A094150 11,19,20,4,6,12,13,6,6,5,3,16,5,12,12,11,18,16,18,17,12,5,12,12,18,
%U A094150 19,14,4,5,12,18,10,16,6,13,17,21,19,6,13,19,4,3,7,15,10,21,4,18,3,5,20,11,18
%N A094150 Number of iterations of the sum of digits of the divisors of R(n) needed to reach 15, where R(n) = A002275.
%e A094150 a(9)=3 because 111111111 -> 151 -> 8 -> 15.
%e A094150 a(1) does not exist because 1 -> 1 and never reaches 15.
%Y A094150 Cf. A002275, A034690, A086793.
%K A094150 less,nonn,base
%O A094150 2,1
%A A094150 _Jason Earls_, Jun 01 2004
%E A094150 More terms from _David Wasserman_, May 22 2007