Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A085766
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A085766 Smallest m such that n divides the tetrahedral number A000292(m). +0
1
1, 1, 6, 1, 2, 6, 4, 5, 24, 2, 8, 6, 10, 5, 7, 13, 14, 25, 16, 3, 6, 9, 20, 7, 22, 10, 78, 5, 26, 7, 28, 29, 8, 14, 4, 25, 34, 17, 24, 7, 38, 6, 40, 9, 24, 21, 44, 15, 46, 22, 15, 11, 50, 78, 8, 5, 16, 26, 56, 7, 58, 29, 25, 61, 12, 42, 64, 14, 43, 13, 68, 53, 70, 34, 24, 17, 19, 25, 76, 13 (list; graph; listen)
OFFSET

1,3

EXAMPLE

Let te(m)=(m+1)(m+2)(m+3)/6. Then te(1)=1, te(2)=4, te(3)=10, te(4)=20, te(5)=35 and te(6)=56. te(6) is the first tetrahedral number to be divisible by 3, hence a(3)=6.

PROGRAM

(PARI) te(n)=(n+1)*(n+2)*(n+3)/6 for (n=1, 50, c=1; while (te(c)%n!=0, c++); print1(c", "))

CROSSREFS

Cf. A011772 (triangular numbers), A019554 (squares).

Sequence in context: A090551 A070682 A112828 this_sequence A002329 A053453 A156792

Adjacent sequences: A085763 A085764 A085765 this_sequence A085767 A085768 A085769

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), Jul 22 2003

EXTENSIONS

More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Feb 10 2005

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 November 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research