[go: up one dir, main page]

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!)
Revision History for A133418 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A133418 Let l(n) = number of letters in n, A005589(n). If l(n) = 4 set a(n) = 0; otherwise a(n) = a(l(n)) + 1.
(history; published version)
#11 by T. D. Noe at Thu Jul 04 13:11:30 EDT 2013
STATUS

editing

approved

#10 by T. D. Noe at Thu Jul 04 13:11:27 EDT 2013
COMMENTS

The smallest n with a(n) = 6 is 1,103,323,373,373,373,373,373,373,373,3731103323373373373373373373373373 (one nonillion one hundred and three octillion ...) which has 323 letters.

STATUS

proposed

editing

#9 by Roland Kneer at Thu Jul 04 07:49:10 EDT 2013
STATUS

editing

proposed

Discussion
Thu Jul 04 08:11
Roland Kneer: If we redefine this with a(4) = -1, it is just the same as A016037
#8 by Roland Kneer at Thu Jul 04 07:49:03 EDT 2013
COMMENTS

The smallest n with a(n) = 6 is 1,103,323,373,373,373,373,373,373,373,373 (one nonillion one hundred and three octillion ...) which has 232323 letters.

STATUS

proposed

editing

#7 by Roland Kneer at Thu Jul 04 07:48:25 EDT 2013
STATUS

editing

proposed

#6 by Roland Kneer at Thu Jul 04 07:47:59 EDT 2013
COMMENTS

The smallest n with a(n) = 6 is 1,103,323,373,373,373,373,373,373,373,373 (one nonillion one hundred and three octillion ...) which has 232 letters.

STATUS

approved

editing

#5 by Russ Cox at Fri Mar 30 16:50:43 EDT 2012
AUTHOR

_N. J. A. Sloane (njas(AT)research.att.com), _, Nov 27 2007

Discussion
Fri Mar 30 16:50
OEIS Server: https://oeis.org/edit/global/110
#4 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

R. J. Mathar, <a href="="/A133418/b133418.txt">Table of n, a(n) for n = 0..11999</a>

R. J. Mathar, <a href="="/A133418/a133418.txt">Maple program to make b-file</a>

KEYWORD

nonn,word,easy,new

#3 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
LINKS

R. J. Mathar, <a href="http://www.research.att.com/~njas/sequences/b133418.txt">Table of n, a(n) for n = 0..11999</a>

R. J. Mathar, <a href="http://www.research.att.com/~njas/sequences/a133418.txt">Maple program to make b-file</a>

KEYWORD

nonn,word,easy,new

AUTHOR

N. J. A. Sloane (njas, (AT)research.att.com), Nov 27 2007

#2 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008
LINKS

Richard R. J. Mathar, <a href="http://www.research.att.com/~njas/sequences/b133418.txt">Table of n, a(n) for n = 0..11999</a>

Richard R. J. Mathar, <a href="http://www.research.att.com/~njas/sequences/a133418.txt">Maple program to make b-file</a>

KEYWORD

nonn,word,easy,new

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 August 29 23:09 EDT 2024. Contains 375519 sequences. (Running on oeis4.)