login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A257391 Numbers of the form 4^p*(4^p+1)*(2^p-1) with p an odd prime. 3
29120, 32537600, 34093383680, 36011213418659840, 36888985097480437760, 38685331082014736871587840, 39614005699412557795646504960, 41538369916519054182462860998737920, 44601490313984496701256699111250939955118080, 45671926145323068271210017365594287580527984640 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
5 divides (4^m+1) for odd m, so every term in this sequence is a multiple of 5 (A008587).
A064487(k) = 4^(2k+1)*(4^(2k+1)+1)*(2^(2k+1)-1), so this sequence is a subsequence of A064487.
Every non-solvable number (A056866) is divisible by 12 or 20. All non-solvable numbers not divisible by 12 (A008594) are divisible by a member of this sequence. In particular, every primitive non-solvable number (A257146) not divisible by 12 is in this sequence.
All terms are divisible by 320 and have at least 4 distinct prime factors. - Jianing Song, Apr 04 2022
REFERENCES
See A056866 and A064487 for references.
LINKS
FORMULA
a(n) = 4^p*(4^p+1)*(2^p-1) where p = A065091(n) = A000040(n+1).
PROG
(Sage) [4^nth_prime(n)*(4^nth_prime(n)+1)*(2^nth_prime(n)-1) for n in range(2, 12)]
(PARI) a(n)=my(p=prime(n+1)); 4^p*(4^p+1)*(2^p-1) \\ Charles R Greathouse IV, Apr 21 2015
CROSSREFS
Subsequence of A008587, A008602, A056866, and A064487.
Sequence in context: A206017 A250762 A249465 * A015313 A242741 A152939
KEYWORD
nonn,easy
AUTHOR
Danny Rorabaugh, Apr 21 2015
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 29 23:00 EDT 2024. Contains 373856 sequences. (Running on oeis4.)