login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The OnLine Encyclopedia of Integer Sequences
!)
A205838
The least number j such that 2 divides s(k)s(j), where k(n)=
A205720
(n).
3
1, 1, 3, 2, 1, 3, 4, 1, 3, 4, 6, 2, 5, 1, 3, 4, 6, 7, 1, 3, 4, 6, 7, 9, 2, 5, 8, 1, 3, 4, 6, 7, 9, 10, 1, 3, 4, 6, 7, 9, 10, 12, 2, 5, 8, 11, 1, 3, 4, 6, 7, 9, 10, 12, 13, 1, 3, 4, 6, 7
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,3
COMMENTS
For a guide to related sequences, see
A205840
.
LINKS
Table of n, a(n) for n=1..60.
EXAMPLE
(See the example at
A205587
.)
MATHEMATICA
(See the program at
A205587
.)
CROSSREFS
Cf.
A204890
,
A205587
,
A205840
.
Sequence in context:
A211705
A010267
A023636
*
A238583
A238556
A102288
Adjacent sequences:
A205835
A205836
A205837
*
A205839
A205840
A205841
KEYWORD
nonn
AUTHOR
Clark Kimberling
, Feb 01 2012
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 June 21 21:50 EDT 2024. Contains 373559 sequences. (Running on oeis4.)