Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A105733
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A105733 Numbers n such that A105658(2n-1) != 2n-1 and A105658(2n) != n. +0
3
12, 13, 21, 22, 25, 27, 28, 29, 32, 42, 43, 50, 52, 54, 62, 64, 66, 70, 72, 73, 76, 81, 82, 85, 87, 90, 91, 92, 96, 99, 102, 103, 106, 112, 117, 120, 122, 123, 126, 129, 131, 132, 135, 140, 142, 144, 147, 152, 154, 155, 158, 159, 162, 169 (list; graph; listen)
OFFSET

1,1

FORMULA

A105658(n) = Product_{i=1..n} i^i / denominator( sum_{j=1..n} j(j+1)/2 / product_{k=0..i-1} j!/k!) ).

MATHEMATICA

f[n_] := f[n] = Product[i^i, {i, n}]/Denominator[Sum[j(j + 1)/2/(Product[j!/k!, {k, 0, j - 1}]), {j, n}]]; Select[ Range[125], f[2# - 1] != 2# - 1 && f[2# ] != # &]

CROSSREFS

Cf. A105658, A105731, A105732, A105769.

Sequence in context: A003894 A084622 A057488 this_sequence A035123 A123132 A050840

Adjacent sequences: A105730 A105731 A105732 this_sequence A105734 A105735 A105736

KEYWORD

nonn

AUTHOR

Jess E. Boling (tdbpeekitup(AT)yahoo.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Apr 18 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research