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!)
A263831 Values of k such that the number of rooted trees with k nodes (A000081(k)) is odd. 3
1, 2, 5, 8, 10, 14, 15, 16, 17, 18, 22, 23, 25, 27, 28, 30, 33, 35, 38, 40, 42, 49, 50, 56, 61, 64, 65, 67, 68, 71, 73, 74, 75, 76, 77, 78, 82, 84, 87, 93, 98, 99, 104, 108, 113, 114, 115, 117, 118, 119, 120, 121, 122, 123, 124, 127, 128, 135, 137, 138, 139 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Complement of A258592.
LINKS
MATHEMATICA
Module[{t}, t[1] = 1; t[k_] := t[k] = Sum[DivisorSum[k-m, t[#] # &] t[m]/(k-1), {m, k-1}]; Select[Range[140], OddQ@t[#] &]] (* after Alois P. Heinz *)
CROSSREFS
Sequence in context: A100829 A030713 A219222 * A189457 A189362 A189928
KEYWORD
nonn
AUTHOR
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 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)