login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A286373 a(n) = A286366(A048673(n)). 4
4, 6, 8, 13, 4, 6, 11, 11, 13, 8, 9, 9, 28, 12, 30, 12, 14, 11, 8, 6, 9, 13, 21, 12, 40, 14, 269, 42, 4, 13, 8, 14, 64, 13, 21, 12, 65, 20, 8, 21, 11, 8, 11, 8, 11, 8, 116, 20, 13, 14, 8, 65, 23, 9, 11, 13, 14, 9, 9, 11, 14, 11, 66, 85, 21, 30, 28, 11, 12, 13, 13, 42, 14, 11, 20, 14, 30, 6, 66, 9, 12, 84, 49, 11, 8, 9, 23, 8, 28, 9, 11, 8, 65, 13, 484, 11, 20 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..10000

Indranil Ghosh, Python program to generate the sequence

FORMULA

a(n) = A286366(A048673(n)).

PROG

(Scheme) (define (A286373 n) (A286366 (A048673 n)))

CROSSREFS

Cf. A048673, A278224, A286366, A286371, A286372.

Sequence in context: A318761 A020153 A307866 * A286372 A151760 A273938

Adjacent sequences:  A286370 A286371 A286372 * A286374 A286375 A286376

KEYWORD

nonn

AUTHOR

Antti Karttunen, May 09 2017

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 November 13 23:01 EST 2019. Contains 329106 sequences. (Running on oeis4.)