login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A196750 Numbers n such that 3, 5, 7 and 11 do not divide swing(n) = A056040(n). 3
0, 1, 2, 6320 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

It is conjectured that there are no other terms.

LINKS

Table of n, a(n) for n=1..4.

Peter Luschny, On the prime factors of the swinging factorial.

MAPLE

# The function Search is defined in A196747.

A196750_list := n -> Search(n, [3, 5, 7, 11]):  # n is a search limit

PROG

(PARI) valp(n, p)=my(s); while(n\=p, s+=n); s

is(n)=valp(n, 3)==2*valp(n\2, 3) && valp(n, 5)==2*valp(n\2, 5) && valp(n, 7)==2*valp(n\2, 7) && valp(n, 11)==2*valp(n\2, 11) \\ Charles R Greathouse IV, Feb 02 2016

CROSSREFS

Cf. A005836, A129508, A030979, A151750, A196747, A196748, A196749.

Sequence in context: A129060 A190127 A099690 * A107021 A107022 A330901

Adjacent sequences:  A196747 A196748 A196749 * A196751 A196752 A196753

KEYWORD

nonn,bref

AUTHOR

Peter Luschny, Oct 06 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 2 18:07 EST 2021. Contains 349445 sequences. (Running on oeis4.)