Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A014741
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A014741 Numbers n such that n divides s(n), where s(1)=1, s(k)=2*s(k-1)+k. +0
5
1, 2, 6, 18, 42, 54, 126, 162, 294, 342, 378, 486, 882, 1026, 1134, 1314, 1458, 1806, 2058, 2394, 2646, 3078, 3402, 3942, 4374, 5334, 5418, 6174, 6498, 7182, 7938, 9198, 9234, 10206, 11826, 12642, 13122, 14154, 14406, 16002, 16254 (list; graph; listen)
OFFSET

1,2

COMMENT

Also numbers n that divide Eulerian numbers A000295(n+1) = 2^(n+1) - n - 2. Also numbers n that divide A086787(n) = Sum[ i^j, {i, 1, n}, {j, 1, n}]. It appears that if k>1 is a term of a(n) then 3*k is also a terms of a(n). - Alexander Adamchuk (alex(AT)kolmogorov.com), Nov 03 2006

CROSSREFS

Cf. A000295, A086787.

Sequence in context: A034881 A064842 A101695 this_sequence A016059 A027556 A120414

Adjacent sequences: A014738 A014739 A014740 this_sequence A014742 A014743 A014744

KEYWORD

nonn

AUTHOR

njas, Olivier Gerard (ogerard(AT)ext.jussieu.fr)

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research