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!)
A246794 a(n) = A246785(A005669(n)). 2
1, 1, 1, 2, 2, 3, 4, 4, 3, 5, 7, 5, 5, 4, 4, 3, 4, 4, 4, 5, 5, 5, 4, 7, 11, 8, 7, 8, 5, 10, 3, 4, 6, 9, 6, 8, 12, 8, 4, 10, 6, 9, 10, 7, 9, 4, 6, 7, 10, 7, 8, 5, 8, 10, 9, 8, 8, 4, 6, 7, 8, 9, 2, 10, 7, 6, 9, 8, 6, 4, 4, 7, 4, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
2,4
COMMENTS
Conjecture: For every n, a(n) is positive.
a(64) = 2 and A246795(64) = 30 hence A182134(49749629143526 - k) = k for 1 < k < 31, where 49749629143526 = A005669(64).
LINKS
CROSSREFS
Sequence in context: A293596 A301977 A085430 * A334030 A285333 A086416
KEYWORD
nonn,hard
AUTHOR
Farideh Firoozbakht, Oct 25 2014
STATUS
approved

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 April 19 04:35 EDT 2024. Contains 371782 sequences. (Running on oeis4.)