Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119908
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119908 Largest squared prime factor of the odd Catalan number (A038003[n]) or 1, if it is square-free. +0
2
1, 1, 3, 1, 11, 13, 13, 29, 43, 61, 79, 107, 181, 251 (list; graph; listen)
OFFSET

2,3

COMMENT

Odd Catalan number is A038003[n] = A000108[2^n-1] = binomial(2^(n+1)-2, 2^n-1)/(2^n).

EXAMPLE

There is no a(1) because A038003[1] = 1.

a(2) = 1 because A038003[2] = 5 square-free.

a(3) = 1 because A038003[3] = 429 = 3*11*13 square-free.

a(4) = 3 because A038003[4] = 9694845 = 3^2*5*17*19*23*29.

CROSSREFS

Cf. A038003, A000108.

Sequence in context: A110440 A135574 A008969 this_sequence A153257 A002185 A002589

Adjacent sequences: A119905 A119906 A119907 this_sequence A119909 A119910 A119911

KEYWORD

nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Aug 02 2006

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 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research