login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A302202 a(n) = number of distinct words arising in Post's tag system {00, 1101} applied to the word (100)^n , or a(n) = -1 if this word has an unbounded trajectory. 1
6, 21, 16, 31, 412, 57, 2156, 859, 382, 2811, 372, 2609, 704, 37913, 618, 155, 1008, 2407, 1210, 629, 5286, 1779, 1468, 4346275, 4130, 3247, 7024, 3891, 14638, 7025, 4570, 4329, 147694, 1863, 11126, 81147, 20210, 3853, 116020, 7641, 6494 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n) = A284119(n) + A284121(n) (or -1 if the trajectory is unbounded).

a(n) is a lower bound on A284116(3n) (assuming that there is no starting string with an unbounded trajectory).

LINKS

Lars Blomberg, Table of n, a(n) for n = 1..6075

CROSSREFS

Cf. A284119, A284121; A284116.

Sequence in context: A321776 A064929 A298266 * A200831 A184291 A102993

Adjacent sequences:  A302199 A302200 A302201 * A302203 A302204 A302205

KEYWORD

nonn

AUTHOR

Lars Blomberg and N. J. A. Sloane, Apr 19 2018

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 17 23:41 EDT 2021. Contains 345088 sequences. (Running on oeis4.)